Test lambda 表达式用于排序

#include<bits/stdc++.h>
#define int long long
#define PII pair<int,int>
#define ULL unsigned long long
#define all(v) v.begin(), v.end()
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
constexpr int N =  1 * 1e6 + 10,M = 5 * 1e3 + 10,inf = 0x3f3f3f3f;

struct node
{
    int x,y,dis;
};
void solve()
{
    int n;
    cin >> n;
    vector<node> vec(n);
    for(int i=0;i<n;i++)
    {
        auto &[x,y,dis] = vec[i];
        cin >> x >> y;
        dis = x*x+y*y;
    }

    sort(all(vec),[](const node &a,const node &b){
        return a.dis < b.dis;
    });

    for(auto [x,y,dis] : vec) cout << x << ' ' << y << ' ' << dis << '\n';
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(nullptr),cout.tie(nullptr);
    int _=1;
    // cin>>_;
    while(_--)
    {
        solve();
    }
    return 0;
}