PAT-A-1062. Talent and Virtue (25)
来源:互联网 发布:centos7 yum安装wget 编辑:程序博客网 时间:2024/05/29 15:15
1062. Talent and Virtue (25)
About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people's talent and virtue. According to his theory, a man being outstanding in both talent and virtue must be a "sage(圣人)"; being less excellent but with one's virtue outweighs talent can be called a "nobleman(君子)"; being good in neither is a "fool man(愚人)"; yet a fool man is better than a "small man(小人)" who prefers talent than virtue.
Now given the grades of talent and virtue of a group of people, you are supposed to rank them according to Sima Guang's theory.
Input Specification:
Each input file contains one test case. Each case first gives 3 positive integers in a line: N (<=105), the total number of people to be ranked; L (>=60), the lower bound of the qualified grades -- that is, only the ones whose grades of talent and virtue are both not below this line will be ranked; and H (<100), the higher line of qualification -- that is, those with both grades not below this line are considered as the "sages", and will be ranked in non-increasing order according to their total grades. Those with talent grades below H but virtue grades not are cosidered as the "noblemen", and are also ranked in non-increasing order according to their total grades, but they are listed after the "sages". Those with both grades below H, but with virtue not lower than talent are considered as the "fool men". They are ranked in the same way but after the "noblemen". The rest of people whose grades both pass the L line are ranked after the "fool men".
Then N lines follow, each gives the information of a person in the format:
ID_Number Virtue_Grade Talent_Gradewhere ID_Number is an 8-digit number, and both grades are integers in [0, 100]. All the numbers are separated by a space.
Output Specification:
The first line of output must give M (<=N), the total number of people that are actually ranked. Then M lines follow, each gives the information of a person in the same format as the input, according to the ranking rules. If there is a tie of the total grade, they must be ranked with respect to their virtue grades in non-increasing order. If there is still a tie, then output in increasing order of their ID's.
Sample Input:14 60 8010000001 64 9010000002 90 6010000011 85 8010000003 85 8010000004 80 8510000005 82 7710000006 83 7610000007 90 7810000008 75 7910000009 59 9010000010 88 4510000012 80 10010000013 90 9910000014 66 60Sample Output:
1210000013 90 9910000012 80 10010000003 85 8010000011 85 8010000004 80 8510000007 90 7810000006 83 7610000005 82 7710000002 90 6010000014 66 6010000008 75 7910000001 64 90
提交代
码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<stdio.h>
using namespace std;
struct student
{
int id;
int v;
int t;
int sum;
int rank;
}stu[100010];
int cmp(student s1, student s2)
{
if (s1.rank != s2.rank)
return s1.rank < s2.rank;
else if (s1.sum != s2.sum)
return s1.sum>s2.sum;
else if (s1.v != s2.v)
return s1.v > s2.v;
else
return s1.id < s2.id;
}
int main()
{
int M, L, H;
int a, b, c;
int num = 0;
cin >> M >> L >> H;
for (int i = 0; i < M; i++)
{
cin >> a >> b >> c;
if (b >= L && c >= L)
{
stu[num].id = a;
stu[num].v = b;
stu[num].t = c;
stu[num].sum = stu[num].t + stu[num].v;
if (stu[num].v >= H&&stu[num].t >= H)
{
stu[num].rank = 1;
}
else if (stu[num].v >= H&&stu[num].t < H)
{
stu[num].rank = 2;
}
else if (stu[num].v < H&&stu[num].t < H&&stu[num].v >= stu[num].t)
{
stu[num].rank = 3;
}
else
{
stu[num].rank = 4;
}
num++;
}
}
sort(stu, stu + num, cmp);
cout << num << endl;
for (int i = 0; i < num; i++)
{
//cout << stu[i].id << " " << stu[i].v << " " << stu[i].t << endl;
printf("%d %d %d\n", stu[i].id, stu[i].v, stu[i].t);
}
system("pause");
return 0;
}
- PAT A 1062. Talent and Virtue (25)
- PAT-A 1062. Talent and Virtue (25)
- PAT-A-1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)-PAT
- pat 1062. Talent and Virtue (25)
- 【PAT】1062. Talent and Virtue (25)
- PAT (Advanced) 1062. Talent and Virtue (25)
- PAT 1062. Talent and Virtue (25)
- 【PAT甲级】1062. Talent and Virtue (25)
- PAT甲级1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)-PAT甲级
- PAT 甲级 1062. Talent and Virtue (25)
- PAT甲级 1062. Talent and Virtue (25)
- PAT 1062. Talent and Virtue
- PAT 1062. Talent and Virtue
- PAT--1062. Talent and Virtue
- PAT-Talent and Virtue (25)
- pat(A) 1062. Talent and Virtue(结构体排序)
- jenkins权威指南学习---第一章---jenkins介绍
- 解题报告:武大第十五届校赛网络赛 H.Werewolf 树型DP
- leetcode解题之102&107. Binary Tree Level Order Traversal java版(二叉树层次遍历)
- Struts2 Web 资源获取的4种方式
- Angular中实现文字的渐变效果
- PAT-A-1062. Talent and Virtue (25)
- Ueditor在.net配置遇到config、hander等未定义的解决方法
- 初探进程及task_struct
- python 基础教程 23章NNTP 2
- Mac系统如何显示.开头的文件夹或者隐藏的文件夹
- leetcode 557 Reverse Words in a String III C++
- python 基础教程 23章NNTP 3
- 用python抓取斗鱼网的弹幕
- 百度:地震姜常宏,求传播?!! http://t.qq.com/jiangchanghong2016