Rank

最新推荐文章于 2018-04-21 14:32:02 发布

towave

最新推荐文章于 2018-04-21 14:32:02 发布

阅读量468

点赞数

文章标签： ACM 水题排序

本文链接：https://blog.csdn.net/wust_towave/article/details/8963142

版权

Rank

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2575 Accepted Submission(s): 779

Problem Description

Jackson wants to know his rank in the class. The professor has posted a list of student numbers and marks. Compute Jackson’s rank in class; that is, if he has the top mark(or is tied for the top mark) his rank is 1; if he has the second best mark(or is tied) his rank is 2, and so on.

Input

The input consist of several test cases. Each case begins with the student number of Jackson, an integer between 10000000 and 99999999. Following the student number are several lines, each containing a student number between 10000000 and 99999999 and a mark between 0 and 100. A line with a student number and mark of 0 terminates each test case. There are no more than 1000 students in the class, and each has a unique student number.

Output

For each test case, output a line giving Jackson’s rank in the class.

Sample Input

#include<cstring>
#include<algorithm>
using namespace std;
struct student
{
    char code[10];
    int score;
    int rank;
} stu[1100];
int cmp(struct student a,struct student b)
{

    return a.score>b.score;
}
int main()
{
    char a[10],b[10];
    int i,j,k,m;
    while(~scanf("%s",a))
    {
        i=0;
        while(1)
        {
            scanf("%s%d",b,&m);
            if(strcmp(b,"0")==0&&m==0)
            {
                break;
            }
            strcpy(stu[i].code,b);
            stu[i].score=m;
            i++;
        }
        sort(stu,stu+i,cmp);
        stu[0].rank=0;//可不要
        for(j=0;j<i-1;j++)
        {
            if(stu[j+1].score==stu[j].score)
            {
                stu[j+1].rank=stu[j].rank;
            }
            else
            {
                stu[j+1].rank=j+1;//重要，不能随意更改
            }

        }
        for(j=0; j<i; j++)
        {
            if(strcmp(stu[j].code,a)==0)
            {
                printf("%d\n",stu[j].rank+1);
                break;
            }
        }
    }
    return 0;
}

Sample Output

Source

2007省赛集训队练习赛（2）

Recommend

lcy