| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 88363 | sh25_wuyy | 跳绳比赛 | C++ | Accepted | 0 MS | 252 KB | 461 | 2026-05-10 19:15:48 |
#include<bits/stdc++.h> #include<algorithm> #include<functional> using namespace std; int main(){ int x; int s[5],t[5]; for(int i=1;i<=5;++i){ cin>>x; s[i-1]=x; t[i-1]=x; }sort(s,s+5,greater<int>()); for(int i=0;i<5;++i){ cout<<t[i]<<"--"; for(int j=0;j<5;j++){ if(s[j]==t[i]){ cout<<j+1<<endl; break; } } }return 0; }