HDU 1718 Rank

http://acm.hdu.edu.cn/showproblem.php?pid=1718

 

Rank

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1895    Accepted Submission(s): 682

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

20070101 20070102 100 20070101 33 20070103 22 20070106 33 0 0

 

 

Sample Output

2

 

 

Source

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

 

 

Recommend

lcy

 

分析：因为做多了结构体捆绑，qsort排序，这个题一上手也是这么想的，AC了，但是网上看到，其实根本不用这么麻烦。

代码如下：

（1）

#include<stdio.h>
#include<stdlib.h>
struct pp
{
  int iden;
  int grade;
  int paiming;
};
pp ans[1002];
int cmp(const void* a,const void* b)
{
  struct pp*c=(pp*)a;
  struct pp*d=(pp*)b;
  return c->grade<d->grade?1:-1;
}
int main()
{
  int flag,i,count;
  while(scanf("%d",&flag)!=EOF)
  {
    count=0;
    while(scanf("%d%d",&ans[count].iden,&ans[count].grade)!=EOF)
    {
      if(ans[count].iden==0&&ans[count].grade==0) break;
      else count++;
    }
    qsort(ans,count,sizeof(pp),cmp);
    ans[0].paiming=0;
    for(i=0;i<count-1;i++)
      {
      if(ans[i].grade==ans[i+1].grade) ans[i+1].paiming=ans[i].paiming;
      else ans[i+1].paiming=i+1;
      }
                for(i=0;i<count;i++)
                    if(ans[i].iden==flag) printf("%d\n",ans[i].paiming+1);
  }
  return 0;
}

 

（2）网上看到的，比我的简洁明了。还好我的空间使用和AC花的时间都比他少，算是心理安慰吧。。。。转自 qq775445624

1. #include<iostream>   
2. using namespace std;  
3. int main()  
4. {  
5.  int flag;  
6.  int t;  
7.  int r;  
8.  int num[500];  
9.  int a,b,c;  
10.  while(cin>>t)  
11.  {  
12.   r=1;  
13.   c=0;  
14.   while(cin>>a>>b)  
15.   {  
16.    if(a==0&&b==0)  
17.     break;  
18.    if(a==t)  
19.     flag=b;  
20.    num[c++]=b;  
21.   }  
22.   for(a=0;a<c;a++)  
23.    if(num[a]>flag)  
24.     r++;  
25.    cout<<r<<endl;  
26.  }  
27. }