Submission #1626748

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int n,tmp;
vector<pair<int,int>> p(100010);

int main(){
	cin >> n;
	REP(i,0,n) cin >> tmp,p[i]=make_pair(tmp,i);
	sort(p.begin(), p.end()); reverse(p.begin(), p.end());
	
	REP(i,0,n) cout << p[i].second+1 << endl;
	return 0;
}

Submission Info

Judge Result