题解 | #最长&最短文本#

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;

bool cmp(string a,string b)
{
    return a.size() < b.size();
}

int main(){
    vector<string>arr;
    string s;
    while(getline(cin,s))
        arr.push_back(s);
    sort(arr.begin(),arr.end(),cmp);
    int minlo = 0 ,maxlo = 0;
    int minlen = arr[0].size() , maxlen = arr[0].size();
    for(int i = 0; i < arr.size(); i++ )
    {
        if(arr[i].size()>maxlen)
            {maxlo =i ; maxlen = arr[i].size();}
        if(arr[i].size()==minlen)
            minlo++;
    }
    for(int i = 0; i < minlo ; i++ )
    cout<<arr[i]<<endl;
    for(int i = maxlo; i < arr.size() ; i++ )
    cout<<arr[i]<<endl;
    return 0;
}