HDOJ 1718 Rank

Rank

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

Total Submission(s): 4407    Accepted Submission(s): 1705

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
  
  

 

题目意思懂了就很水，先给出一个学号，再给出很多学号和学号对应学生的成绩，求给出学号学生的成绩排名。(同个成绩，并列排)。

代码如下：

<span style="font-size:14px;">#include<cstdio>
int a[1010],b[1010];
int main()
{
	int n,i,j,cnt,ans,sign;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;;i++)
		{
			scanf("%d%d",&a[i],&b[i]);
				if(a[i]==n)
				   sign=i;
				if(!a[i]||!b[i])
				   break;
		}
		ans=1;
		for(j=0;j<i;j++)
		{
			if(b[j]>b[sign])
			   ans++;
		}
		printf("%d\n",ans);
	}
	return 0;
} </span>