Submission #2711752

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main()
{
  int N;
  cin >> N;
  vector< pair<int, int> > v;
  for(int i = 0; i < N; i++) {
    int a;
    cin >> a;
    v.push_back(make_pair(a, i + 1));
  }
  sort(v.begin(), v.end(), greater< pair<int, int> >());
  for(int i = 0; i < N; i++) {
    cout << v[i].second << endl;
  }
  return 0;
}
    

Submission Info

Judge Result