提交时间:2024-01-25 09:06:04
运行 ID: 127440
#include<bits/stdc++.h> using namespace std; struct P{ int num,id; }cnt[1005]; bool cmp(P s1,P s2){ if(s1.num!=s2.num)return s1.num>s2.num; return s1.id<s2.id; } int main(){ int n; cin>>n; int maxn = 1; for(int i=1;i<=n;i++){ int x; cin>>x; maxn = max(maxn,x); cnt[x].num++; cnt[x].id=x; } sort(cnt+1,cnt+maxn+1,cmp); while(cnt[maxn].num==0){ maxn--; } for(int i=1;i<=maxn;i++){ if(cnt[i].num==0)continue; cout<<cnt[i].id; if(i!=maxn)cout<<"->"; } return 0; }