PAT1062

#include<iostream>
#include<string>
#include<string.h>


#include<algorithm>
using namespace std;


struct student
{
char id[10];
int de,cai,sum;
int flag;
}stu[100050];


bool cmp(student a,student b)
{
if (a.flag!=b.flag){return  (a.flag<b.flag);}
else if (a.sum!=b.sum){return(a.sum>b.sum);}
else if (a.de!=b.de){return(a.de>b.de);}
else return (strcmp(a.id,b.id)<0);
}
int main()
{
int n,l,h,m;//m为及格人数
cin>>n>>l>>h;
m=n;
for (int i=0;i<n;i++)
{
scanf("%s%d%d",&stu[i].id ,&stu[i].de,&stu[i].cai);
stu[i].sum=stu[i].de+stu[i].cai;
if (stu[i].de<l || stu[i].cai<l)
{
m--;
stu[i].flag=5;
}
else if (stu[i].de>=h && stu[i].cai>=h){stu[i].flag=1;}
else if (stu[i].de>=h && stu[i].cai<=h){stu[i].flag=2;}
else if (stu[i].de>=stu[i].cai)        {stu[i].flag=3;}
else   {stu[i].flag=4;};
}
sort(stu,stu+n,cmp);
cout<<m<<endl;
for (int i=0;i<m;i++)
{
printf("%s %d %d\n",stu[i].id,stu[i].de,stu[i].cai);
}

system("pause");
return 0;

}

1.本次使用sort进行排序

  (1)打开头文件#include<algorithm> 
  (2)sort基本格式（sort(a,a+len,cmp)）
  (3)bool cmp(element x,element y)

2.strcmp(a,b) a>b则>0