zoukankan      html  css  js  c++  java
  • 1141 PAT Ranking of Institutions (25 分)

    After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the ranklist.

    Input Specification:

    Each input file contains one test case. For each case, the first line gives a positive integer N (105​​), which is the number of testees. Then N lines follow, each gives the information of a testee in the following format:

    ID Score School
    

    where ID is a string of 6 characters with the first one representing the test level: B stands for the basic level, A the advanced level and T the top level; Scoreis an integer in [0, 100]; and School is the institution code which is a string of no more than 6 English letters (case insensitive). Note: it is guaranteed that ID is unique for each testee.

    Output Specification:

    For each case, first print in a line the total number of institutions. Then output the ranklist of institutions in nondecreasing order of their ranks in the following format:

    Rank School TWS Ns
    

    where Rank is the rank (start from 1) of the institution; School is the institution code (all in lower case); ; TWS is the total weighted score which is defined to be the integer part of ScoreB/1.5 + ScoreA + ScoreT*1.5, where ScoreX is the total score of the testees belong to this institution on level X; and Ns is the total number of testees who belong to this institution.

    The institutions are ranked according to their TWS. If there is a tie, the institutions are supposed to have the same rank, and they shall be printed in ascending order of Ns. If there is still a tie, they shall be printed in alphabetical order of their codes.

    Sample Input:

    10
    A57908 85 Au
    B57908 54 LanX
    A37487 60 au
    T28374 67 CMU
    T32486 24 hypu
    A66734 92 cmu
    B76378 71 AU
    A47780 45 lanx
    A72809 100 pku
    A03274 45 hypu
    

    Sample Output:

    5
    1 cmu 192 2
    1 au 192 3
    3 pku 100 1
    4 hypu 81 2
    4 lanx 81 2
    
     
    #include<iostream>
    #include<vector>
    #include<map>
    #include<algorithm>
    using namespace std;
    
    struct School{
        string name;
        double grade;
        int stuNum;
    }school;
    
    bool cmp(School a,School b){
            if(a.grade != b.grade) return a.grade > b.grade;
        else if(a.stuNum != b.stuNum)
           return a.stuNum < b.stuNum;
        else return a.name < b.name;
    }
    
    int main(){
        int n;
        cin >> n;
        
        string s,str;
        vector<School> sch,ans;
        map<string,int> idx;
        int cnt = 1;
        double score;
        
        for(int i = 0; i < n; i++){
            cin >> s >> score >> str;
            for(int j = 0; j < str.length(); j++){
                if(str[j] >= 'A' && str[j] <= 'Z') 
                    str[j] = str[j] - 'A' + 'a';
            }
            if(s[0] == 'B') score /= 1.5;
            else if(s[0] == 'T') score *= 1.5;
            if(idx.count(str) == 0){
                idx[str] = cnt++;
                school.name = str;
                school.grade = 0;
                school.stuNum = 0;
                sch.push_back(school);
                
            }
            sch[idx[str]-1].grade += score;
            sch[idx[str]-1].stuNum++;
        }
    
       for(int i = 0; i < sch.size(); i++){
            sch[i].grade = (int)sch[i].grade;
        }
        sort(sch.begin(),sch.end(),cmp);
        int rank = 1;
        printf("%d
    ",sch.size());
        cout << rank << " "<< sch[0].name << " " << sch[0].grade << " " << sch[0].stuNum << endl;
        for(int i = 1; i < sch.size(); i++){
            if(sch[i].grade != sch[i-1].grade){
                rank = i + 1; 
            }
        
            cout << rank << " "<< sch[i].name << " " << sch[i].grade << " " << sch[i].stuNum << endl;
        }
        return 0;
    }
  • 相关阅读:
    服务器重启
    aliyun修复漏洞之后,重启php-fpm命令
    数据结构和算法绪论(一)
    微信小程序+微信公众号开发总结
    数字校园项目-学生失联预警系统(三)----数据库设计
    数字校园项目-学生失联预警系统(二)-----项目部署
    数字校园项目-学生失联预警系统(一)
    gdut极路由破解教程
    项目:JavaWeb聊天室(问题汇总)
    项目:点餐系统(问题汇总)
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10458567.html
Copyright © 2011-2022 走看看