#include <iostream> #include <algorithm> using namespace std; struct p { int score, id, inid; }a[2000]; bool cmp(p x, p y) {return x.score > y.score;} int main() { int n; cin >> n; for(int i = 1; i <= n; i++) {cin >> a[i].score; a[i].inid = i;} sort(a + 1, a + n + 1, cmp); int cur = 0; for(int i = 1; i <= n; i++) { if(a[i].score != a[cur].score) cur = i; a[i].id = cur; } for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) if(a[j].inid == i) cout << a[j].score << " " << a[j].id << endl; return 0; }