POJ2153 - Rank List - map模拟

1.题目描述：

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

2.题意概述：

　存在N个学生，并有M次考试，分别计算每次考试后某个人的综合排名。

3.解题思路：

考虑声明一个从 string 到 int 的map类，其中 string 对应名字， int 对应分数。

4.AC代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <ctime>
#define INF 0x7fffffff
#define maxn 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e 2.718281828459
#define mod (int)1e9 + 7;
using namespace std;
typedef long long ll;

int main()
{
#ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
  long _begin_time = clock();
#endif
  int n, m, k;
  char ch[30];
  map<string, int> mp;
  while (scanf("%d\n", &n) != EOF)
  {
    mp.clear();
    for (int i = 0; i < n; i++)
    {
      gets(ch);
      mp[string(ch)] = 0;
    }
    scanf("%d", &m);
    for (int i = 0; i < m; i++)
    {
      for (int j = 0; j < n; j++)
      {
        scanf("%d", &k);
        getchar();
        gets(ch);
        mp[string(ch)] += k;
      }
      int ans = 1;
      for (map<string, int>::iterator it = mp.begin(); it != mp.end(); it++)
        if (it->second > mp["Li Ming"])
          ans++;
      printf("%d\n", ans);
    }
  }

#ifndef ONLINE_JUDGE
  long _end_time = clock();
  printf("time = %ld ms\n", _end_time - _begin_time);
#endif
  return 0;
}