Submission #1798572

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<functional>

using namespace std;
typedef pair<int, int> P;

P in[100000];

int main() {
	int N;
	cin >> N;
	for (int i = 0; i < N; i++) {
		int a;
		cin >> a;
		in[i].first = a, in[i].second = i + 1;
	}

	sort(in, in + N, greater<P>());

	for (int i = 0; i < N; i++) {
		cout << in[i].second << endl;
	}
	return 0;
}

Submission Info

Judge Result