提交时间:2025-05-03 14:55:15

运行 ID: 320090

#include<bits/stdc++.h> using namespace std; struct hsq{ int g,id; }a[10086]; bool cmp(hsq x,hsq y){ return x.a>a.y; } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].g; a[i].id=i; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++){ cout<<a[i].g<<" "<<endl; } return 0; }