HDOJ 1718 Rank（结构体)

Rank

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

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   |   We have carefully selected several similar problems for you:   1719  1717  1715  1716  1720

注意要有多组测试数据就好，我WA了好多次~~
再给个测试数据：

220070101
220070102 100
220070108 33
220070101 33
220070103 22
220070106 33
0 0
-----------
输出
2

#include<stdio.h>
#include<string.h>
struct Student{
	int num;
	int mark;
}str[110];

int main(){
	int nnum;
	int i,j,k,t;
	int rank;
	while(~scanf("%d",&nnum)){//是有多组测试数据的 
		memset(str,0,sizeof(str));
		for(i=0;scanf("%d%d",&str[i].num,&str[i].mark)&&str[i].num||str[i].mark;i++);
		rank=1;
		for(j=0;j<i;j++) if(str[j].num==nnum) t=str[j].mark;
		for(k=0;k<i;k++) 	if(t<str[k].mark) rank++;
		printf("%d\n",rank);
	}
	
	return 0;
}