Pagini recente » Borderou de evaluare (job #2469834) | Cod sursa (job #1776588)
#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
pair<int,int> v[30001];
int main()
{
int n,i,k;
FILE*fin,*fout;
fin=fopen("schi.in","r");
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&v[i].first);
for(k=1;k<i;k++)
if(v[k].first>=v[i].first)
v[k].first++;
v[i].second=i;
}
sort(v+1,v+n+1);
fclose(fin);
fout=fopen("schi.out","w");
for(i=1;i<=n;i++)
fprintf(fout,"%d\n",v[i].second);
fclose(fout);
return 0;
}