Submission #2207669

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define erep(i,a,b) for(int i=a;i<=(int)(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>(a);i--)
#define eper(i,a,b) for(int i=((int)(a));i>=b;i--)
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
const int INF=(1<<30)-1;
const int MOD=1000000007;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}

int n;
vector<pair<int, int>> a;
int main() {
 ios::sync_with_stdio ( false );
 cin.tie ( 0 );
    cin >> n;
    erep(i, 1, n) {
        int x; 
        cin >> x;
        a.pb(mp(x, i));
    }
    sort(a.begin(), a.end(), greater<pair<int, int>>());
    for (auto itr = a.begin(); itr != a.end(); itr++) {
        pair<int, int> p = *itr;
        printf("%d\n", p.second);
    }
    return 0;
}

Submission Info

Judge Result