题解

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool cmp(string a,string b){
    return a.size()>b.size();
}
int main(){
    string s[210],first;
    int i=0;
    while(cin>>s[i]){
        i++;
    }
    first=s[0];
    sort(s,s+i,cmp);
    if(s[0].size()==first.size()){
        cout<<first<<'\n'<<first;
    }else if(s[i-1].size()==first.size()){
        cout<<s[0]<<'\n'<<first;
    }else{
        cout<<s[0]<<'\n'<<s[i-1];
    }
    return 0;
}