杭电oj【2648 Shopping】做题总结（map的基本操作）

2648 Shopping

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

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

思路：利用字符串数组记录所有的店名，并记录“memory”在数组中的位置为book，利用map完成店价格涨幅的操作，最后查找计算map中“memory”的排名。（每次数据开始之前记得清空map）
AC代码：

#include<cstdio>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
const int maxn=1e4+10;
int n,m,ans;
string a[maxn];
map<string,int>shop;
int main ()
{
	while(cin>>n)
	{
		shop.clear();
		int book;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i];
			shop[a[i]]=0;
			if(a[i]=="memory")
			book=1;
		}
		cin>>m;
		while(m--)
		{
			string s;
			int t;
			ans=1;
			for(int i=1;i<=n;i++)
			{
				cin>>t>>s;
				shop[s]+=t;
			}
			for(int i=1;i<=n;i++)
			if(shop[a[i]]>shop[a[book]])ans++;
			cout<<ans<<endl;
		}
	}
}

仅为本人理解，如有纰漏欢迎指出。