摘要:
#include<stdio.h>#include<iostream>#include<cstdlib>#include<algorithm>using namespace std;struct st{ int a; int b;}f[1001];bool cmp(st p,st q){ if(p.a==q.a) { return p.b>q.b; // >升序 } else return p.a>q.a;}int main(){ int n,i; while(scanf("%d",&n)>0) 阅读全文