Submission #4682261

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct node{
	long long hi;
	int num;
}a[1200000];
bool cmp(node x,node y)
{
	return x.hi>y.hi;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	cin>>a[i].hi,a[i].num=i;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)
	cout<<a[i].num<<endl;
	return 0;
}

Submission Info

Judge Result