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

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>

using namespace std;

bool cmp(pair<string,int>m1,pair<string,int>m2)
{
    return m1.second<m2.second;
}
int main()
{
    string s;
    vector<pair<string,int>>m;

    while(getline(cin,s)){
        pair<string,int> p(s,s.size());
        m.push_back(p);
    }

    stable_sort(m.begin(), m.end(), cmp);
    int minn = (*m.begin()).second;
    int maxx = (*m.rbegin()).second;

    for(auto it:m){
        if(it.second != minn)break;
        cout << it.first << endl;
    }
    for(auto it=m.rbegin(); it!=m.rend();it++){
        if((*it).second!=maxx)break;
        cout << (*it).first << endl;
    }
}