Submission #3772293

---

Source Code Expand

#include <bits/stdc++.h>

#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<pair<ll,ll> > v;
    ll n,a;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a;
        v.pb(make_pair(a,i+1));
    }
    sort(be(v));
    reverse(be(v));
    for(int i=0;i<n;i++){
        cout << v[i].second<<endl;
    }
    return 0;
}

Submission Info

Judge Result