1062 Talent and Virtue

part 2, 2.1

自己解法

认真读题！(惨痛教训)

#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>class person
{
public:person(int ID, int V, int T, int H){this->ID = ID;this->V = V;this->T = T;this->sum = V + T;if (V >= H && T >= H)this->flag = 1;else if (V >= H && T < H)this->flag = 2;else if (V < H && V >= T)this->flag = 3;elsethis->flag = 4;}int ID;int V, T;int sum, flag; // flag = 1 是 sages(V>=H,T>=H)，flag = 2 是 nobleman(V>=H,T<H), flag = 3 是 foolman(T=<V<H)
};bool cmp(person a, person b)
{return a.flag != b.flag ? a.flag < b.flag : (a.sum != b.sum ? a.sum > b.sum : (a.V != b.V ? a.V > b.V : a.ID < b.ID));
}int main()
{int N, L, H;cin >> N >> L >> H;vector<person> v;for (int i = 0; i < N; i++){int ID, V, T;cin >> ID >> V >> T;if (V >= L && T >= L){person p(ID, V, T, H);v.push_back(p);}}sort(v.begin(), v.end(), cmp);int v_size = v.size();cout << v_size << endl;for (int i = 0; i < v_size; i++)cout << v[i].ID << " " << v[i].V << " " << v[i].T << endl;system("pause");return 0;
}

大神解法

柳神

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct node {int num, de, cai;
};
int cmp(struct node a, struct node b) {if ((a.de + a.cai) != (b.de + b.cai))return (a.de + a.cai) > (b.de + b.cai);else if (a.de != b.de)return a.de > b.de;elsereturn a.num < b.num;
}
int main() {int n, low, high;scanf("%d %d %d", &n, &low, &high);vector<node> v[4];node temp;int total = n;for (int i = 0; i < n; i++) {scanf("%d %d %d", &temp.num, &temp.de, &temp.cai);if (temp.de < low || temp.cai < low)total--;else if (temp.de >= high && temp.cai >= high)v[0].push_back(temp);else if (temp.de >= high && temp.cai < high)v[1].push_back(temp);else if (temp.de < high && temp.cai < high && temp.de >= temp.cai)v[2].push_back(temp);elsev[3].push_back(temp);}printf("%d\n", total);for (int i = 0; i < 4; i++) {sort(v[i].begin(), v[i].end(), cmp);for (int j = 0; j < v[i].size(); j++)printf("%d %d %d\n", v[i][j].num, v[i][j].de, v[i][j].cai);}return 0;
}

PAT-1062 Talent and Virtue相关推荐

PAT-B 1015. 德才论(同PAT 1062. Talent and Virtue)
1. 在排序的过程中,注意边界的处理(小于.小于等于) 2. 对于B-level,这题是比較麻烦一些了. 源代码: #include <cstdio> #include <vecto ...
PAT甲级1062 Talent and Virtue：[C++题解]结构体、哈希表
文章目录题目分析题目来源题目分析来源:acwing 分析: 分4个vector,单独排序即可. ac代码 #include<bits/stdc++.h> using namespa ...
PAT 甲级 1062 Talent and Virtue
1062 Talent and Virtue 题目大意:给出一组人数,按照要求分类再排序输出.圣人是virtue和talent都超过h的人,君子是virtue超过h并且talent位于[l,h)区间内 ...
PAT A1062 Talent and Virtue (25分)
题意:德才均大于及格线low的才进行排序,排序的人按种姓分为 :) sages-nobleman-fool man-trash 对于人的类型的排序只需要在结构体中加入一个int type即可,通过这个 ...
1062 Talent and Virtue (25 分)
1062 Talent and Virtue (25 分) 题意先给出三个数N(成员人数),L(及格线),H(优秀线) 给出一组成员信息,包括id,品德,才能,给这组成员排序. 当该成员品德和才能都 ...
1062 Talent and Virtue 25
1062 Talent and Virtue 25 题目链接:A1062 Talent and Virtue 25 问题思路我尝试了两种思路: 根据每个人的分数确定其是哪个级别(rank)的人,以总 ...
1062. Talent and Virtue (25)-PAT甲级真题
About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about ...
PAT甲级1062 Talent and Virtue
About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about ...
1062. Talent and Virtue (25)
About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about ...
1062 Talent and Virtue（排序）
这类题目归结于常用技巧与算法,有很鲜明的套路,重在理解其规则,通常写起来不算太复杂. 题目描述: 题目大致意思: 输入N和最低下限和最高上限,接着输入N个人的编号,美德和天赋.如果美德和天赋都不低于最 ...

PAT-1062 Talent and Virtue

1062 Talent and Virtue

自己解法

大神解法

PAT-1062 Talent and Virtue相关推荐

最新文章

热门文章