Submission #4667665

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
struct bb
{
	long long bian;
	long long shengao;
}a[1000000];
int co(const bb&a,const bb&b)
{
	return a.shengao>b.shengao;
}
int main()
{
	long long n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].shengao;
		a[i].bian=i;
	}
	sort(a+1,a+1+n,co);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i].bian<<endl;
	}
	return 0;
}

Submission Info

Judge Result