#include<bits/stdc++.h> using namespace std;struct studet{string name;int x;}a[15];bool cmp(studet a,studet b){return a.x>b.x;}int main(){int n;cin>>n;for(int i=0;i<n;i++){cin>>a[i].name>>a[i].x;}sort(a,a+n,cmp);for(int i=0;i<n;i++){cout<<a[i].name<<" "<<a[i].x<<endl;}return 0;}

记得加头文件 如下：

#include<bits/stdc++.h> using namespace std; struct studen{ string name; int m; }a[666]; bool cmp(studen a,studen b){ return a.m>b.m; } int main(){ int n; cin>>n; for(int i=0;i<n;i++){ cin>>a[i].name>>a[i].m; } sort(a,a+n,cmp); for(int i=0;i<n;i++){ cout<<a[i].name<<" "<<a[i].m<<endl; } return 0; }

#include<bits/stdc++.h> using namespace std; struct name{ string name; int fen; }a[100001]; void qsort(int left,int right){ if(left>=right) return ; } int main(){ }

你们为什么都不用选择排序！！！题目让你们用你们为什么不用！！！（阴暗的爬行）（尖叫）

#include<bits/stdc++.h> using namespace std; struct worker{ string name; int e; }w[10005]; int cmp(worker x , worker y){ return x.e > y.e; } int main(){ int n; cin >> n; for(int i = 1;i <= n;i++) cin >> w[i].name >> w[i].e; sort(w+1,w+n+1,cmp); for(int i = 1;i <= n;i++) cout << w[i].name << ' ' << w[i].e << '\n'; return 0; }