zoukankan      html  css  js  c++  java
  • [教材]A1025. PAT Ranking (25)

    Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

    Output Specification:

    For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

    registration_number final_rank location_number local_rank

    The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

    Sample Input:

    2
    5
    1234567890001 95
    1234567890005 100
    1234567890003 95
    1234567890002 77
    1234567890004 85
    4
    1234567890013 65
    1234567890011 25
    1234567890014 100
    1234567890012 85
    

    Sample Output:

    9
    1234567890005 1 1 1
    1234567890014 1 2 1
    1234567890001 3 1 2
    1234567890003 3 1 2
    1234567890004 5 1 4
    1234567890012 5 2 2
    1234567890002 7 1 5
    1234567890013 8 2 3
    1234567890011 9 2 4
    
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 #include <iostream>
     4 #include <string.h>
     5 #include <string>
     6 #include <math.h>
     7 #include <algorithm>
     8 using namespace std;
     9 
    10 struct student{
    11    char id[15];
    12    int score;
    13    int loc_num;
    14    int loc_rank; 
    15 } stu[30010];
    16 
    17 
    18 bool cmp(student a,student b)
    19 {
    20   if(a.score!=b.score)
    21   {
    22       return a.score>b.score;
    23   }    
    24   else
    25   {
    26       return strcmp(a.id,b.id)<0; 
    27   }
    28 }
    29 
    30 int main(){
    31    int n,k,num=0;
    32    scanf("%d",&n);
    33    for(int i=1;i<=n;i++)
    34    {
    35        scanf("%d",&k);
    36        for(int j=0;j<k;j++)
    37        {
    38            scanf("%s %d",stu[num].id,&stu[num].score);
    39            stu[num].loc_num=i;
    40            num++;
    41        }
    42        sort(stu+num-k,stu+num,cmp);
    43        stu[num-k].loc_rank=1;
    44        
    45        //对该考场剩余考生
    46     for(int j=num-k+1;j<num;j++)
    47     {
    48            if(stu[j].score==stu[j-1].score)
    49            {
    50                stu[j].loc_rank=stu[j-1].loc_rank;
    51            }else
    52            {
    53                stu[j].loc_rank=j-(num-k)+1;
    54            }
    55     } 
    56    }
    57     
    58     printf("%d
    ",num);
    59     sort(stu,stu+num,cmp);
    60     int r=1;
    61     for(int i=0;i<num;i++)
    62     {
    63         if(i>0&&stu[i].score!=stu[i-1].score){
    64             r=i+1;    
    65         }
    66         printf("%s %d %d %d
    ",stu[i].id,r,stu[i].loc_num,stu[i].loc_rank);
    67     }
    68     return 0;
    69 }
  • 相关阅读:
    CSS背景background、backgroundposition使用详解
    为何img、input等内联元素可以设置宽、高
    各种Js封装
    CSS布局奇淫技巧之各种居中
    document.compatMode属性
    jquery的each()详细介绍
    jQuery所支持的css样式
    js,jQuery获取html5的data*属性
    PHP中MVC的编程思想浅谈
    php读取xml的神器
  • 原文地址:https://www.cnblogs.com/ligen/p/4299999.html
Copyright © 2011-2022 走看看