模拟题。
#include #include #include #include #include #include using namespace std; const double eps=1e-8; struct student{ char name[50]; double score; }ss[1005]; int maomao[1000],old[1000]; struct node{ char teamname[50]; int pos; }ttt[1000]; int is_prime(int n){ int i; for(i=2;i<=sqrt(n);i++){ if(n%i==0) return 0; } return 1; } int cmp1(int a,int b){ return a>b; } int cmp2(struct student a,struct student b){ if(fabs(a.score-b.score) b.score; } int main() { int t; scanf("%d",&t); while(t--){ int n,m,i,j,k; memset(maomao,-1,sizeof(maomao)); memset(old,-1,sizeof(old)); scanf("%d%d",&n,&m); int r; scanf("%d",&r); for(i=0;i =3){ rr=(sy[2]-1200)*1.5/100; } ss[i].score+=rr; } sort(ss,ss+n,cmp2); for(i=0;i