题目连接

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

Rank

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

stl大法好。。

 1 #include<algorithm>
 2 #include<iostream>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<map>
 7 using std::map;
 8 map<int, int> rec;
 9 int main() {
10 #ifdef LOCAL
11     freopen("in.txt", "r", stdin);
12     freopen("out.txt", "w+", stdout);
13 #endif
14     int num, id, score, rank, targe;
15     while (~scanf("%d", &num)) {
16         rank = 0, rec.clear();
17         while (~scanf("%d %d", &id, &score) && id + score) rec[id] = score;
18         targe = rec[num];
19         map<int, int>::iterator ite;
20         for (ite = rec.begin(); ite != rec.end(); ++ite) {
21             if (ite->second > targe) rank++;
22         }
23         printf("%d\n", rank + 1);
24     }
25     return 0;
26 }

View Code

转载于:https://www.cnblogs.com/GadyPu/p/4563512.html

hdu 1718 Rank相关推荐

HDU 1718 Rank counting sort解法
本题是利用counting sort的思想去解题. 注意本题,好像利用直接排序,然后查找rank是会直接被判WA的.奇怪的推断系统. 由于分数值的范围是0到100,很小,而student 号码又很大, ...
（HDU）1718 -- Rank （段位）
题目链接:https://vjudge.net/problem/HDU-1718 这题还好,不用考虑字典序排名(可以并列排名),看到有的人用了结构体或二重数组,介于这题的特殊性,其实不用这样. #in ...
HDU 1811 Rank of Tetris（并查集按秩合并+拓扑排序）
Rank of Tetris Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T ...
HDU 2643 Rank：第二类Stirling数
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2643 题意: 有n个个选手参赛,问排名有多少种情况(可以并列). 题解: 简化问题: 将n个不同的元素 ...
HDU 1811 Rank of Tetris
Rank of Tetris Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total ...
hdu 1811 Rank of Tetris (并查集+拓扑排序)
Problem - 1811 感觉这题的并查集以及拓扑排序并不难,但是做题的时候必须理解到矛盾(CONFLICT)与不确定(UNCERTAIN)直接的优先关系. 做这题的时候,构图什么的很简单,就是没 ...
HDU - 1811 Rank of Tetris 并查集 + 拓扑序 +me
link 题意: 首先看到排名自然想到拓扑序,但是存在等于的情况,这就启发我们把等于的情况缩成一个点,让后在缩点后的图中进行拓扑即可. 对于不合法的情况当然是拓扑序没有遍历到应该遍历的点,所以只需要检 ...
HDU -1704 Rank——floyd
信奥中的数学：斯特林数、卡特兰数
P1287 盒子与球(球不同盒不同不允许有空盒) 盒子与球 - 洛谷第二类斯特林数总结第二类斯特林数总结 - _zjz 的博客 - 洛谷博客 P4091 [HEOI2016/TJOI2016] ...

hdu 1718 Rank