洛谷——排序P1781宇宙总统

#include<bits/stdc++.h>
#define f(a,b,c) for(int a=b;a<=c;a++)
#define f1(a,b,c) for(int a=b;a>=c;i--)
using namespace std;

bool cmp(pair<int,string> a,pair<int,string> b){
    if(a.second.size() != b.second.size()){
        return a.second.size() > b.second.size();
    }else
        return a.second>b.second;
}
int main(){
    pair<int,string> t[21];
    int n;
    cin>>n;
    f(i,1,n) cin>>t[i].second,t[i].first = i;
    sort(t+1,t+n+1,cmp);
    cout<<t[1].first<<"\n"<<t[1].second;
    return 0;
}