？我那个小破题还能押上

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
struct node{
	int val[10005] = {0}, len = 1;//定义高精度数
}tmp;
int idx;
char A[10005];
int n;
node read(char *A){//录入
	node a;
	a.len = strlen(A);
	for(int i = 0; i < a.len; i++){
		a.val[a.len - i] = A[i] - '0';
	}return a;
}bool cmp(node a, node b){//比较
	if(a.len > b.len) return 1;
	if(a.len < b.len) return 0;
	for(int i = a.len; i >= 1; i--){
		if(a.val[i] > b.val[i]) return 1;
		if(a.val[i] < b.val[i]) return 0;
	}return 0;
}
int main(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		scanf("%s", A);
		node a = read(A);
		if(cmp(a, tmp)) tmp = a, idx = i;
	}cout << idx << endl;
    for(int i = tmp.len; i >= 1; i--){
		printf("%d", tmp.val[i]);//输出
	}
	
}