Shopping HDU - 2648题解

题目

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

解题思路

题目大意：输入若干个店家，和n天涨价的价格，输出n天后memory店的价格在所有店里面的排名
使用stl的map使店家的字符串和店内价格创建映射，每次涨价后map的second值便累加，最后输出memory店当前排名

代码

#include"bits/stdc++.h"
using namespace std;
int main(){
	map<string,int>mp;
	int n;
	while(cin>>n){
		string shop;
		int temp=n;
		while(temp--)cin>>shop;
		int m;
		cin>>m;
		while(m--){
			for(int i=0;i<n;i++){
				int price;
				cin>>price>>shop;
				mp[shop]+=price;
			}
			int no=1;
			map<string,int>::iterator it;//使用迭代器访问map
			for(it=mp.begin();it!=mp.end();it++){
    			if(it->second>mp["memory"])no++;//注意使用迭代器访问map的second值要使用->
    		}
			cout<<no<<endl;
		}
		mp.clear();//注意每次处理一组数据后要清空
	}
}