学习链接:https://blog.csdn.net/a272846945/article/details/50829610?locationNum=7
#include<iostream> #include<cstdio> #include<cstring> #include<stdio.h> #include<string.h> #include<cmath> #include<math.h> #include<algorithm> #include<set> #include<queue> #include<map> typedef long long ll; using namespace std; const ll mod=1e9+7; const int maxn=1e8+10; const int maxk=100+10; const int maxx=1e4+10; const ll maxa=2520; #define INF 0x3f3f3f3f3f3f struct node { ll x,y,va; char s[10]; }b[150]; bool cmp(const node a,const node b) { //return strcmp(a.s,b.s)<0; 这是给结构体中字符串从小到大排序的 return a.x<b.x;//这是给整数从小到大排序的,从大到小只需要改为>就行 } int main() { ios::sync_with_stdio(false); int n; cin>>n; for(int i=0;i<n;i++) { //cin>>b[i].s; cin>>b[i].x; } sort(b,b+n,cmp); for(int i=0;i<n;i++) cout<<b[i].x<<" "; cout<<endl; return 0; }