题目传送门
sort! sort! sort
话不多说,上AC代码
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#define SIZE 20 + 10
using namespace std;
struct Node{
string str;
int id;
} a[SIZE];
bool cmp(Node, Node);
int main() {
freopen("cpp.in", "r", stdin);
freopen("cpp.out", "w", stdout);
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
cin >> a[i].str;
a[i].id = i;
}
sort(a + 1, a + n + 1, cmp);
printf("%d\n", a[1].id);
cout << a[1].str << endl;
return 0;
}
bool cmp(Node x, Node y) {
if (x.str != y.str) {
if (x.str.size() != y.str.size()) {
return x.str.size() > y.str.size();
}
return x.str > y.str;
}
return x.id < y.id;
}