1015. 德才论 (25)

来源：互联网发布：淘宝能买到a碟吗编辑：程序博客网时间：2024/06/05 15:40

#include<cstdio>#include<vector>#include<algorithm>#include<cstring>using namespace std;struct student{char num[10];int dei;int cai;};bool compare1(const student &s1,const student &s2){if ((s1.cai + s1.dei) == (s2.cai + s2.dei)){if (s1.dei == s2.dei){if (s1.cai == s2.cai){ int i=strcmp(s1.num, s2.num); return i<0;}else {return s1.cai > s2.cai;}}else{return s1.dei > s2.dei;}}else{return ((s1.cai + s1.dei) > (s2.cai + s2.dei));}}int main(){int n, L, H;while (scanf("%d %d %d", &n, &L, &H) != EOF){vector<student> stu1;vector<student> stu2;vector<student> stu3;vector<student> stu4;int m = 0;for (int i = 0; i < n; i++){char n[10];int d, c;scanf("%s %d %d", &n, &d, &c);if (d >= H&&c >= H){student stu;stu.cai = c;stu.dei = d;strcpy(stu.num, n);stu1.push_back(stu);m++;}else if (d >= H && c<H && c>=L){student stu;stu.cai = c;stu.dei = d;strcpy(stu.num, n);stu2.push_back(stu);m++;}else if (d < H&&c <= d&&d >= L&&c >= L){student stu;stu.cai = c;stu.dei = d;strcpy(stu.num, n);stu3.push_back(stu);m++;}else if (d >= L&&c >= L){student stu;stu.cai = c;stu.dei = d;strcpy(stu.num, n);stu4.push_back(stu);m++;}}printf("%d\n", m);sort(stu1.begin(), stu1.end(), compare1);sort(stu2.begin(), stu2.end(), compare1);sort(stu3.begin(), stu3.end(), compare1);sort(stu4.begin(), stu4.end(), compare1);for(int j=0;j<stu1.size();j++){printf("%s %d %d\n", stu1[j].num, stu1[j].dei, stu1[j].cai);}for (int j = 0; j<stu2.size(); j++){printf("%s %d %d\n", stu2[j].num, stu2[j].dei, stu2[j].cai);}for (int j = 0; j<stu3.size(); j++){printf("%s %d %d\n", stu3[j].num, stu3[j].dei, stu3[j].cai);}for (int j = 0; j<stu4.size(); j++){printf("%s %d %d\n", stu4[j].num, stu4[j].dei, stu4[j].cai);}}return 0;}

按要求将输入的数据分为四类，使用vector盛着

分别排序

分别输出（这里很奇怪，不可以用for each，但是vs编译可以通过，这里就不可以，所以改为了for循环）

其实排序和输出可以再写一个子程序。

[C++ Primer] C++中sort对类对象进行排序

阅读全文

0 0