结构体排序重载小于号和cmp函数

//#include<bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <set>
#include <queue>
#include <math.h>
#include <map>
#include <algorithm>
#include <stack>
#include <regex>
#include <sstream>
#include <list>
#include <hash_map>
#include <unordered_map>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=20000;

struct nn
{
    int a,b;
    nn(){}
    nn(int a,int b):a(a),b(b){}
//    bool operator < (const nn & n)const
//    {
//        return a==n.a?b<n.b:a<n.a;
//    }

};
bool cmp(nn x,nn y)
{
    return x.a==y.a?x.b<y.b:x.a<y.a;
}

vector<nn>v;

int main()
{
    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int a,b;
        cin>>a>>b;
        v.push_back(nn(a,b));
    }

    sort(v.begin(),v.end(),cmp);
    for(int i=0;i<n;i++){
        cout<<v[i].a<<" "<<v[i].b<<endl;
    }
    return 0;
}