HDU2648 Shopping【map】

Shopping

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6661 Accepted Submission(s): 2326

Problem Description
Every girl likes shopping,so does dandelion.Now she finds the shop is increasing the price every day because the Spring Festival is coming .She is fond of a shop which is called “memory”. Now she wants to know the rank of this shop’s price after the change of everyday.

Input
One line contians a number n ( n<=10000),stands for the number of shops.
Then n lines ,each line contains a string (the length is short than 31 and only contains lowercase letters and capital letters.)stands for the name of the shop.
Then a line contians a number m (1<=m<=50),stands for the days .
Then m parts , every parts contians n lines , each line contians a number s and a string p ,stands for this day ,the shop p 's price has increased s.

Output
Contains m lines ,In the ith line print a number of the shop “memory” ‘s rank after the ith day. We define the rank as :If there are t shops’ price is higher than the “memory” , than its rank is t+1.

Sample Input
3
memory
kfc
wind
2
49 memory
49 kfc
48 wind
80 kfc
85 wind
83 memory

Sample Output
1
2

问题链接：HDU2648 Shopping
问题简述：（略）
问题分析：
    本题用map实现，不解释。
    这个题应该也可以用字典树实现，也可以用Hash函数实现。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* HDU2648 Shopping */

#include <bits/stdc++.h>

using namespace std;

const int N = 10000;
struct Node {
    int id, s;
} a[N];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, m, id, p;
    string word, s;
    while(cin >> n) {
        map<string, int> mp;

        for(int i = 0; i < n; i++) {
            cin >> word;
            mp[word] = i;

            a[i].id = i;
            a[i].s = 0;
            if(word == "memory") id = i;
        }

        cin >> m;
        while(m--) {
            for(int i = 0; i < n; i++) {
                cin >> p >> s;
                a[mp[s]].s += p;
            }

            int cnt = 0;
            for(int i = 0; i < n; i++)
                if(a[i].s > a[id].s) cnt++;

            printf("%d\n", cnt + 1);
        }
    }

    return 0;
}