8 solutions
-
0
Guest MOD
-
-9
刘浩锦 (lqst2025035) LV 6 @ 2025-6-6 17:01:24
看看看看个蛋
-
刘丛睿 (lqst2025013)
@ 2026-3-25 18:03:23
#include<bits/stdc++.h> #include using namespace std; int n; struct node{ int m; int b; string s; }p[10000]; bool cmp(node p1,node p2){ if(p1.b>p2.b){ return p1>p2; }else{ return p2>p1; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].s>>p[i].b; } sort(b+n,b+n+1,cmp); for(int i=1;i<=n;i++){ p[i].m=i; cout<<p[i].m<<" "<<p[i].s<<" "<<p[i].b<<" "<<endl; } return 0; }
#include<bits/stdc++.h> #include using namespace std; int n; struct node{ int m; int b; string s; }p[10000]; bool cmp(node p1,node p2){ if(p1.b>p2.b){ return p1>p2; }else{ return p2>p1; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].s>>p[i].b; } sort(b+n,b+n+1,cmp); for(int i=1;i<=n;i++){ p[i].m=i; cout<<p[i].m<<" "<<p[i].s<<" "<<p[i].b<<" "<<endl; } return 0; }
#include<bits/stdc++.h> #include using namespace std; int n; struct node{ int m; int b; string s; }p[10000]; bool cmp(node p1,node p2){ if(p1.b>p2.b){ return p1>p2; }else{ return p2>p1; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].s>>p[i].b; } sort(b+n,b+n+1,cmp); for(int i=1;i<=n;i++){ p[i].m=i; cout<<p[i].m<<" "<<p[i].s<<" "<<p[i].b<<" "<<endl; } return 0; }
#include<bits/stdc++.h> #include using namespace std; int n; struct node{ int m; int b; string s; }p[10000]; bool cmp(node p1,node p2){ if(p1.b>p2.b){ return p1>p2; }else{ return p2>p1; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].s>>p[i].b; } sort(b+n,b+n+1,cmp); for(int i=1;i<=n;i++){ p[i].m=i; cout<<p[i].m<<" "<<p[i].s<<" "<<p[i].b<<" "<<endl; } return 0; }
#include<bits/stdc++.h> #include using namespace std; int n; struct node{ int m; int b; string s; }p[10000]; bool cmp(node p1,node p2){ if(p1.b>p2.b){ return p1>p2; }else{ return p2>p1; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].s>>p[i].b; } sort(b+n,b+n+1,cmp); for(int i=1;i<=n;i++){ p[i].m=i; cout<<p[i].m<<" "<<p[i].s<<" "<<p[i].b<<" "<<endl; } return 0; }
#include<bits/stdc++.h> #include using namespace std; int n; struct node{ int m; int b; string s; }p[10000]; bool cmp(node p1,node p2){ if(p1.b>p2.b){ return p1>p2; }else{ return p2>p1; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>p[i].s>>p[i].b; } sort(b+n,b+n+1,cmp); for(int i=1;i<=n;i++){ p[i].m=i; cout<<p[i].m<<" "<<p[i].s<<" "<<p[i].b<<" "<<endl; } return 0; }
-
Guest
MOD
