题解 | 最长&最短文本

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
using namespace std;
vector<string>v;
typedef struct Str{
    int len;
    int num;
}SS;
SS str[10000];
bool cmp(SS s1,SS s2)
{
    if(s1.len!=s2.len)return s1.len<s2.len;
    return s1.num<s2.num;
}
int main() {
    string s;
    int len = 0;
    while(getline(cin,s))
    {
        v.push_back(s);
        str[len].len=s.size();
        str[len].num = len;
        len++;
    }
    sort(str,str+len,cmp);
    int minn = str[0].len,maxx = str[len-1].len;
    for(int i=0;i<len;i++)
    {
        if(str[i].len==minn||str[i].len==maxx)
        {
            cout<<v[str[i].num]<<endl;
        }
    }
}
// 64 位输出请用 printf("%lld")