ACM-STEP Rank

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

杭电上的题目

就是一个简单的排序问题 

给出学号，然后查找其对应的成绩所在的排名。需要注意的是分数相同的话，按同样的名次排列。

所以可以采用这样的方法 从高到低排序 然后查找所在位置。计算出比jackson分数高的人数 即是名次。