#include<algorithm>
struct node{
int x,y;
}m[1000];
int cmp(int a,int b)
{
if(a.x==b.x)
return a.y>b.y;
else
return a.x>b.x;
}
int main()
{
sort (m,m+N,cmp);
}
二维数组利用结构体进行排序
最新推荐文章于 2024-08-13 17:31:27 发布
#include<algorithm>
struct node{
int x,y;
}m[1000];
int cmp(int a,int b)
{
if(a.x==b.x)
return a.y>b.y;
else
return a.x>b.x;
}
int main()
{
sort (m,m+N,cmp);
}