数据结构之快排

#include <iostream>#include<algorithm>using namespace std;struct su{int x;int y;}node [50];bool cmp(su a, su b)//按照x从小到大排序，若相同，再按y从小到大排序{return a.x<b.x;}int main(){int n;cin>>n;for (int i=0; i<n; i++){cin>>node[i].x>>node[i].y;}sort(node, node+n, cmp);//快排for (int i=0; i<n; i++){cout<<node[i].x<<" "<<node[i].y<<endl;}return 0;}