POJ 2153 Rank List(map)
来源:互联网 发布:hishop云商城源码 编辑:程序博客网 时间:2024/06/06 14:28
题目链接:http://poj.org/problem?id=2153
Rank List
Time Limit: 10000MS Memory Limit: 65536K
Total Submissions: 10857 Accepted: 3654
Description
Li Ming is a good student. He always asks the teacher about his rank in his class after every exam, which makes the teacher very tired. So the teacher gives him the scores of all the student in his class and asked him to get his rank by himself. However, he has so many classmates, and he can’t know his rank easily. So he tends to you for help, can you help him?
Input
The first line of the input contains an integer N (1 <= N <= 10000), which represents the number of student in Li Ming’s class. Then come N lines. Each line contains a name, which has no more than 30 letters. These names represent all the students in Li Ming’s class and you can assume that the names are different from each other.
In (N+2)-th line, you’ll get an integer M (1 <= M <= 50), which represents the number of exams. The following M parts each represent an exam. Each exam has N lines. In each line, there is a positive integer S, which is no more then 100, and a name P, which must occur in the name list described above. It means that in this exam student P gains S scores. It’s confirmed that all the names in the name list will appear in an exam.
Output
The output contains M lines. In the i-th line, you should give the rank of Li Ming after the i-th exam. The rank is decided by the total scores. If Li Ming has the same score with others, he will always in front of others in the rank list.
Sample Input
3
Li Ming
A
B
2
49 Li Ming
49 A
48 B
80 A
85 B
83 Li Ming
Sample Output
1
2
【思路分析】先特殊记录李明的分数,然后再整个map中扫一遍,看比李明分数高的人有多少个。
【AC代码】
#include<cstdio>#include<cstring>#include<string>#include<iostream>#include<stack>#include<queue>#include<map>#include<algorithm>using namespace std;char str[25];int main(){ int n; while(~scanf("%d",&n)) { getchar(); if(n==0) { break; } map<string,int>m; for(int i=0; i<n; i++)//每个名字初始化为1分 { gets(str); m[str]++; } int t; scanf("%d",&t); getchar(); int num,flag=1;//flag记录LIMING 的分数,一开始为什么是1可以想一下 for(int i=0; i<t; i++) { for(int i=0; i<n; i++) { scanf("%d",&num); getchar(); memset(str,0,sizeof(str)); gets(str); m[str]+=num; if(strcmp(str,"Li Ming")==0) { flag+=num; } } int pp=1; map<string,int>::iterator it; for(it=m.begin();it!=m.end();++it) { if(it->second>flag) { pp++; } } printf("%d\n",pp); } } return 0;}
- POJ 2153 Rank List(map)
- Rank List - POJ 2153 map
- POJ 2153 Rank List map
- POJ 2153 Rank List map的应用
- poj 2153 Rank List
- poj 2153 Rank List
- POJ 2153 Rank List
- poj 2153 Rank List
- Poj 2153 Rank List
- POJ2153 Rank List(Map)
- POJ 2153 Rank List G++
- POJ 2135 Rank List
- pku 2153 Rank List
- Rank List
- Rank List
- POJ 2379 ACM Rank Table(水~)
- HDU 5131 Song Jiang's rank list (结构体+MAP,2014广州现场赛)
- POJ2153-Rank List
- hdu 1036 (水题控制输入输出格式)
- Java8 Lambda表达式 ,此时不用,更待何时?
- 第八周OJ3求值
- Auto Control 000 自动控制原理 为什么要学
- .so has text relocations. This is wasting memory and prevents security hardening. Please fix.
- POJ 2153 Rank List(map)
- Node.js在windows下的安装
- 基于边界值分析方法选择测试用例的原则
- Apple公司Darwin流式服务器源代码分析(四)
- 用python代码实现文件的拷贝
- NOIP2015day2 跳石子
- poj Sudoku
- 1017. Queueing at Bank (25)
- Python调用Matlab实现混合编程