pat1062. Talent and Virtue (25)
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_Grade
where 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 80 10000001 64 90 10000002 90 60 10000011 85 80 10000003 85 80 10000004 80 85 10000005 82 77 10000006 83 76 10000007 90 78 10000008 75 79 10000009 59 90 10000010 88 45 10000012 80 100 10000013 90 99 10000014 66 60
Sample Output:
12 10000013 90 99 10000012 80 100 10000003 85 80 10000011 85 80 10000004 80 85 10000007 90 78 10000006 83 76 10000005 82 77 10000002 90 60 10000014 66 60 10000008 75 79 10000001 64 90
提交代码
文字游戏,幸好题目的样例很典型。
1 #include<cstdio> 2 #include<stack> 3 #include<cstring> 4 #include<iostream> 5 #include<stack> 6 #include<set> 7 #include<map> 8 #include<algorithm> 9 using namespace std; 10 struct record{ 11 char id[10]; 12 int VG,TG,r; 13 record(){ 14 r=0; 15 } 16 }; 17 bool cmp(record a,record b){ 18 if(a.r==b.r){ 19 if(a.VG+a.TG==b.VG+b.TG){ 20 if(a.VG==b.VG){ 21 return strcmp(a.id,b.id)<0; 22 } 23 return a.VG>b.VG; 24 } 25 return a.VG+a.TG>b.VG+b.TG; 26 } 27 return a.r>b.r; 28 } 29 //Virtue_Grade Talent_Grade 30 int main(){ 31 //freopen("D:\\INPUT.txt","r",stdin); 32 int n,l,h; 33 scanf("%d %d %d",&n,&l,&h); 34 record *per=new record[n+1]; 35 int i,count=0,VG,TG,r=0; 36 char id[10]; 37 for(i=0;i<n;i++){ 38 scanf("%s %d %d",&id,&VG,&TG); 39 if(VG>=l&&TG>=l){//有可能 40 if(VG>=h&&TG>=h){ 41 per[count].r+=3; 42 } 43 else if(VG>=h&&TG<h){//nobleman 44 per[count].r+=2; 45 } 46 else if(VG<h&&TG<h&&VG>=TG){//fool man 47 per[count].r+=1; 48 } 49 strcpy(per[count].id,id); 50 per[count].VG=VG; 51 per[count].TG=TG; 52 count++; 53 } 54 } 55 sort(per,per+count,cmp); 56 printf("%d\n",count); 57 for(i=0;i<count;i++){ 58 printf("%s %d %d\n",per[i].id,per[i].VG,per[i].TG); 59 } 60 return 0; 61 }
转载于:https://www.cnblogs.com/Deribs4/p/4779479.html
pat1062. Talent and Virtue (25)相关推荐
- 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 分)(坑点分析)
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 (25)-PAT甲级真题
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 a ...
- PAT-1062 Talent and Virtue
1062 Talent and Virtue part 2, 2.1 自己解法 认真读题!(惨痛教训) #include <iostream> using namespace std; # ...
- 【PAT甲级】1062 Talent and Virtue (25分)
解题过程的小记录,如有错误欢迎指出. 小导航~ 题目分析 注意点 我的解题过程 思路 bug 代码 dalao的代码 借鉴点 题目分析 对一组人的德才分按照给定的规则进行排序 注意点 弄清楚一共分为四 ...
- PAT甲级1062 Talent and Virtue:[C++题解]结构体、哈希表
文章目录 题目分析 题目来源 题目分析 来源:acwing 分析: 分4个vector,单独排序即可. ac代码 #include<bits/stdc++.h> using namespa ...
最新文章
- 用NVIDIA A100 GPUs提高计算机视觉
- Python Tutorial(十):浏览标准库(一)
- 创建ASP.NET WEB自定义控件——例程2
- 开发者进阶宝典,HarmonyOS 职业认证全奉上
- linux ctrl+r撤销_Linux入门基础,掌握这些命令,不再做小白
- 计算机主键盘的布局,计算机键盘的布局,结构和布置
- java平衡二叉树,最全Java知识总结
- Android中Activity之间的数据传递(Intent和Bundle)
- 一款强大的Kubernetes API流量查看神器
- python csv文件读取行列_使用Numpy读取CSV文件,并进行行列删除的操作方法
- [dp] LeetCode 62. Unique Paths
- 大神们都应该去哪里工作?
- local variable 'xxx' referenced before assignment
- 学习进度——第十二周
- 我心中的核心组件~HttpHandler和HttpModule实现图像的缩放与Url的重写
- stream流_最详细的JDK8新特性————Stream流
- mysql常用sql总结_获取多个字段最大值最小值
- 笔记本电脑桌面没有显示计算机,关于笔记本电脑外接显示器后没有桌面图标的问题...
- android官方模拟器下载安装,网易MuMu模拟器
- MyBatis超详细笔记