结构体的sort排序；

#include <bits/stdc++.h>
#include<iostream>
#define ll long long
#define MAX 100005
#define js ios::sync_with_stdio(0);cin.tie(0);
#define MOD 1e9+7
using namespace std; 
typedef struct node{
    ll a;
    ll b;
    ll c;
}TM;
bool kmp(TM x,TM y)
{
    if(x.a!=y.a)
        return x.a<y.a;
    if(x.b!=y.b)
        return x.b<y.b;
    return x.c<y.c;
}
int main()
{
    js;
    TM a[MAX];
    ll i,n;
    cin>>n;
    for(i=0 ; i<n ; i++)
        cin>>a[i].a>>a[i].b>>a[i].c;
    sort(a,a+n,kmp);
    for(i=0 ; i<n ; i++)
        cout<<a[i].a<<" "<<a[i].b<<" "<<a[i].c<<endl;
    return 0;
}