#include <cstdio>
#include <iostream>
#include <algorithm>
const int MAXN = 40010;
int N;
struct Point
{
int x;
bool operator< (const Point& T) const
{
return x < T.x;
}
}P[MAXN];
struct Points
{
int x;
}Ps[MAXN];
bool cmp(Points a,Points b)
{
return a.x < b.x;
}
int main()
{
while (~scanf("%d",&N) && N)
{
for (int i(0);i < N;++i)
{
scanf("%d",&P[i].x);
Ps[i].x = P[i].x;
}
//自定义排序方式一
std::sort(P,P+N);
//自定义排序方式二
std::sort(Ps,Ps+N,cmp);
}
return 0;
}
sort 对结构体排序
最新推荐文章于 2022-10-27 20:40:53 发布