Submission #1180418

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
typedef long long ll;
int n;
struct P {
	ll a, b;
};
bool operator<(P a, P b) { return a.a < b.a; }
bool operator>(P a, P b) { return a.a > b.a; }
P a[100000];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i].a;
		a[i].b = i + 1;
	}
	sort(a, a + n);
	reverse(a, a + n);
	for (int i = 0; i < n; i++) {
		cout << a[i].b << endl;
	}
}

Submission Info

Judge Result