大佬求带

#include<bits/stdc++.h>
using namespace std;
struct nb {
	int a;
	string b;
}e[21];
int cmp1(nb a,nb c) {
	if (a.b.size() < c.b.size()) return a.b > c.b;
	if (a.b.size() == c.b.size() && a.b < c.b)return a.b > c.b;
}
int main(){
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> e[i].b;
		e[i].a = i;
	}sort(e+1, e +n+1,cmp1);
	cout << e[1].a << endl<<e[1].b;
	return 0;
}