http://acm.hdu.edu.cn/showproblem.php?pid=2648
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.
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
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
using namespace std;
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF)
{
string temp;
map<string,int >m1;
m1.clear();
for(i=0; i<n; i++)
{
cin>>temp;
m1[temp]=0;
}
int t,flag;
scanf("%d",&t);
while(t--)
{
int ans=0;
for(i=0; i<n; i++)
{
int a;
string b;
cin>>a>>b;
m1[b]+=a;
if(b=="memory")
{
flag=m1[b];
}
}
map<string,int>::iterator pp;
pp=m1.begin();
while(pp!=m1.end())
{
if(pp->second>flag)
ans++;
pp++;
}
printf("%d\n",ans+1);
}
}
return 0;
}