AcWing 862. 三元组排序
原题链接
简单
作者:
满地王八我壳最绿.
,
2023-12-03 17:33:37
,
所有人可见
,
阅读 37
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 10010;
struct Data
{
int x;
double y;
string z;
bool operator< (const Data &t) const
{
return x < t.x;
}
}a[N];//定义结构体数组
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> a[i].x >> a[i].y >> a[i].z;
sort(a, a + n);//运用sort函数按X从小到大排序
for (int i = 0; i < n; i ++ )
printf("%d %.2lf %s\n", a[i].x, a[i].y, a[i].z.c_str());//输出
return 0;
}