【PAT】【Advanced Level】1062. Talent and Virtue (25)
来源:互联网 发布:河北省网络行政学院 编辑:程序博客网 时间:2024/06/05 13:03
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
https://www.patest.cn/contests/pat-a-practise/1062
https://www.nowcoder.com/pat/5/problem/4029
思路:
条件判断+结构体排序
CODE:
#include<iostream>#include<vector>#include<string>#include<cstring>#include<algorithm>#include<cstdio>using namespace std;typedef struct S{ int sno; int d; int c;};//坑点:输入、输出采用scanf 和printf,否则TLES s[4][100000];int n[4]={0,0,0,0};bool cmp(S a, S b){ return a.d+a.c==b.d+b.c?(a.d==b.d?a.sno<b.sno:a.d>b.d):a.d+a.c>b.d+b.c;}int main(){ int a,p,q; scanf("%d %d %d",&a,&p,&q); int bjg=0; for (int i=0;i<a;i++) { S t; //t.sno.resize(100); scanf("%d %d %d",&t.sno,&t.d,&t.c); //cin>>t.sno>>t.d>>t.c; //cout<<t.sno<<t.d<<t.c<<endl; if (t.d>=q && t.c>=q) s[0][n[0]++]=t; else if(t.d>=q&&t.c>=p) s[1][n[1]++]=t; else if(t.d>=t.c&&t.d>=p&&t.c>=p) s[2][n[2]++]=t; else if(t.d>=p&&t.c>=p) s[3][n[3]++]=t; else { bjg++; } } for (int i=0;i<4;i++) sort(s[i],s[i]+n[i],cmp); //cout<<a-bjg<<endl; printf("%d\n",a-bjg); for (int i=0;i<4;i++) { for (int j=0;j<n[i];j++) { printf("%d %d %d",s[i][j].sno,s[i][j].d,s[i][j].c); //cout<<s[i][j].sno<<" "<<s[i][j].d<<" "<<s[i][j].c; if(!(i==3 && j==n[3])) printf("\n"); } }}
- 【C++】PAT (advanced level)1062. Talent and Virtue (25)
- 【PAT】【Advanced Level】1062. Talent and Virtue (25)
- PAT (Advanced) 1062. Talent and Virtue (25)
- PAT (Advanced Level) Practise 1062 Talent and Virtue (25)
- PAT (Advanced Level) Practise 1062 Talent and Virtue (25)
- PAT (Advanced Level) 1062. Talent and Virtue (25) 德才论,结构体排序
- 1062. Talent and Virtue (25)【排序】——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1062(Talent and Virtue)
- 1062. Talent and Virtue (25)-PAT
- pat 1062. Talent and Virtue (25)
- 【PAT】1062. Talent and Virtue (25)
- PAT A 1062. Talent and Virtue (25)
- PAT 1062. Talent and Virtue (25)
- 【PAT甲级】1062. Talent and Virtue (25)
- PAT-A 1062. Talent and Virtue (25)
- PAT甲级1062. Talent and Virtue (25)
- PAT-A-1062. Talent and Virtue (25)
- 1062. Talent and Virtue (25)-PAT甲级
- hdu6071
- 最高效的进(线)程间通信机制: eventfd
- #define 中 # ## ##__VA_ARGS__
- python3 [爬虫入门实战]爬虫之scrapy安装与配置教程
- 分布式消息队列RocketMQ与Kafka架构上的巨大差异之1 -- 为什么RocketMQ要去除ZK依赖?
- 【PAT】【Advanced Level】1062. Talent and Virtue (25)
- [SDUT](2144)图结构练习——最小生成树 ---最小生成树(图)
- NIO的一些坑
- httpURLConnection-网络请求的两种方式-get请求和post请求
- 摆花
- Python: 创建空的list,以及append用法
- TCP协议原理详解
- 数据离散化模板(用STL实现)
- 谈谈谷歌word2vec的原理