hdu 2648 Shopping

*Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10917 Accepted Submission(s): 3946
*

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.

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.

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.

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

1
2

dandelion

曾是惊鸿照影来

//map
#include 
using namespace std;
int main()
{
    int n, m, p;
    map shop;
    while (cin >> n)
    {
        string s;
        //输入商店名字，实际上不用处理
        for (int i = 1; i <= n; i++)
            cin >> s;
        cin >> m;
        while (m--)
        {
            for (int i = 1; i <= n; i++)
            {
                cin >> p >> s;
                shop[s] += p;//用map可以直接操作商店，加上价格
            }
            int rank = 1;
            map::iterator it;//迭代器
            for (it = shop.begin(); it != shop.end(); it++)
            {
                if (it->second > shop["memory"])//比较价格
                    rank++;
            }
            cout << rank << endl;
        }
        shop.clear();
    }
    return 0;
}