HDU--ACMSteps--Rank

Title:Rank

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

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

题目分析：
1、考虑到要存学生成绩，所以用结构体数组；
2、在C++中，string类型的字符串，可以直接用“cin>>字符串名”来进行读入；
3、结构体的字符串读入和比较要在前面加一个头文件string；
做题反思：
要学会思考，想清楚各种判断条件。（1）要执行break语句的条件；（2）排名高低与分数的关系。
代码如下：

#include<iostream>
#include<string>
using namespace std;
struct node{
	string id;
	int mark;
}a[1001];
int main()
{
	string s;
	int n;
	while(cin>>s)
	{
		int i=0;
		while(1)
		{
			cin>>a[i].id>>a[i].mark;
			if(a[i].id=="0"&&a[i].mark==0)
			break;
			if(a[i].id==s)
			n=a[i].mark;//n用于记录Jacson's mark,避免被覆盖 
			i++;
		}
		int rank=1;
		for(int j=0;j<i;j++)
		{
			if(n<a[j].mark)
			rank++;
		}
		cout<<rank<<endl;
	}
	return 0;
}