我竟这种题都A不了......

#include <bits/stdc++.h>
#define int long long
#define TT int T;cin>>T;while(T--)
#define IOS ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
using namespace std;
struct node {
	int hao, piao;
} a[21];
bool cmp(node q, node h) {
	return q.piao > h.piao;
}
signed main() {
	IOS;
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].piao;
		a[i].hao = i;
	}
	sort(a + 1, a + 1 + n, cmp);
	cout << a[n].hao << "\n" << a[n].piao;
	return 0;
}