Submission #1442178

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

int main()
{
    int n;
    cin >> n;

    int a;
    vector<pair<int, int> > pairs(n);
    for(int i=0; i<n; i++){
        cin >> a;
        pairs[i] = make_pair(a, i+1);
    }

    sort(pairs.begin(), pairs.end());

    for(int i=n; i>=0; i--){
        cout << pairs[i].second << endl;
    }

    return 0;
}

Submission Info

Judge Result