结构体数组-sort自定义快排

1）

#include <iostream>
#include <string.h>//memser()
#include <algorithm>//sort()
//#include <bits/stdc++.h>
using namespace std;
struct Num{
    double x;
    double y;
}Number[100010];
bool cmp(const Num &a,const Num &b)
{
    return a.x<b.x;
}
int main()
{
    int n;
    while(cin>>n){
        memset(Number,0,sizeof(Number));
        for(int i=0;i<n;i++){
            cin>>Number[i].x>>Number[i].y;
        }
        sort(Number,Number+n,cmp);
        for(int i=0;i<n;i++){
            cout<<Number[i].x<<" "<<Number[i].y<<endl;
        }
    }
}