链接: 宇宙总统 - 洛谷
总代码:
#includeusing namespace std; struct stu{ int id; string s; int len; }; bool cmp(stu a, stu b){ if(a.len == b.len){ return a.s > b.s; }else{ return a.len > b.len; } } int main(){ int n; cin >> n; stu s[n]; for(int i = 0; i < n; i++){ string s1; cin >> s1; int len1 = s1.size(); s[i] = {i+1, s1, len1}; } sort(s, s+n, cmp); cout << s[0].id << endl; cout << s[0].s << endl; return 0; }



