摘要:
"题目" 插入一个再排序,没有一点难度 struct Node { int x; int y; Node(){} Node(int x,int y){ this x = x; this y =y; } }a[100005]; int Compare(Node a,Node b) { if(a.x== 阅读全文
摘要:
"题目" 简单的结构体排序 struct Node { int x; int y; Node(){} Node(int x,int y){ this x = x; this y =y; } }a[100005]; int Compare(Node a,Node b) { if(a.x==b.x) { 阅读全文