zoukankan      html  css  js  c++  java
  • 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

    #include<iostream>
    #include<cstdio>
    #include<vector>
    #include<algorithm>
    using namespace std;
    struct Node{
    	int id;
    	int vg;
    	int tg;
    }; 
    vector<Node>sage;
    vector<Node>nobleman;
    vector<Node>foolman;
    vector<Node>smallman;
    bool cmp(Node a,Node b){
    	int aid=a.id;
    	int avg=a.vg;
    	int atg=a.tg;
    	int bid=b.id;
    	int bvg=b.vg;
    	int btg=b.tg;
    	int asum=avg+atg;
    	int bsum=bvg+btg;
    	if(asum>bsum){
    		return true;
    	}else if(asum==bsum){
    		if(avg>bvg||(avg==bvg&&aid<bid)){
    			return true;
    		}
    	}else {
    		return false;
    	}
    }
    int main(){
    	int N,L,H;
    	scanf("%d%d%d",&N,&L,&H);
    	int i,j;
    	Node node;
    	int id,vg,tg;
    	for(i=0;i<N;i++){
    		scanf("%d%d%d",&id,&vg,&tg);
    	    node.id=id;
    	    node.vg=vg;
    	    node.tg=tg;
    		if(vg<L||tg<L)continue;
    		else if(vg>=H&&tg>=H){
    			sage.push_back(node);
    		}else if(vg>=H&&tg<=H){
    			nobleman.push_back(node);
    		}else if(vg<H&&tg<H&&vg>=tg){
    			foolman.push_back(node);
    		}else{
    			smallman.push_back(node);
    		}
    	}
    	int sizes=sage.size();
    	int sizen=nobleman.size();
    	int sizef=foolman.size();
    	int sizesm=smallman.size();
    	printf("%d
    ",sizes+sizen+sizef+sizesm);
    	sort(sage.begin(),sage.end(),cmp);
    	sort(nobleman.begin(),nobleman.end(),cmp);
    	sort(foolman.begin(),foolman.end(),cmp);
    	sort(smallman.begin(),smallman.end(),cmp);
    	for(i=0;i<sizes;i++){
    		printf("%d %d %d
    ",sage[i].id,sage[i].vg,sage[i].tg);
    	}
    	for(i=0;i<sizen;i++){
    		printf("%d %d %d
    ",nobleman[i].id,nobleman[i].vg,nobleman[i].tg);
    	}
    	for(i=0;i<sizef;i++){
    		printf("%d %d %d
    ",foolman[i].id,foolman[i].vg,foolman[i].tg);
    	}
    	for(i=0;i<sizesm;i++){
    		printf("%d %d %d
    ",smallman[i].id,smallman[i].vg,smallman[i].tg);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    java jpg图片按质量保存
    Python 九九乘法表
    Linux 磁盘空间查看
    jsTree 隐藏父节点的复选框;只留最底一层的复选框
    padding-top实现列表图片自适应
    jsTree自定义contextmenu 的二种方式
    jstree插件对树操作增删改查的使用
    layui遇到的坑
    layui复选框全选,单选取消全选
    获取 Layui 表单 select 中的 option 的自定义属性
  • 原文地址:https://www.cnblogs.com/grglym/p/7827705.html
Copyright © 2011-2022 走看看