HDU 2648 Shopping

#include <iostream>
#include <vector>
using namespace std;

struct node
{
char str[35];
int price;
node(){price = 0;}
};

const int prime = 100007;
int aa[prime];
vector<node>LIST[prime];

unsigned int BKDRHash(char *str)
{
unsigned int seed = 31,key = 0;
while(*str)
key = key*seed+ *str++;
return key&(0x7fffffff);
}

int main()
{
int n,key,val,len1,m,i,count,res,j,len,price;
node a;
char s[35];

while (scanf("%d",&m)!=EOF)
{
/*多组数据，要清空vector容器*/
for (i=0;i<prime;i++)
LIST[i].clear();

for(i=0;i<m;i++)
{
scanf("%s",s);
strcpy(a.str,s);
key = BKDRHash(s)%prime;
LIST[key].push_back(a);
}
scanf("%d",&n);
while (n--)
{
count = 0;/*统计有几个shop价格大于memory*/
len = 0;/*记录所有价格*/
price = 0;
for(i=0;i<m;i++)
{
scanf("%d%s",&val,s);
key = BKDRHash(s)%prime;
len1 = LIST[key].size();
for (j=0;j<len1;j++)
{
if(!strcmp(LIST[key][j].str,s))
{
LIST[key][j].price+=val;
res = LIST[key][j].price;/*记录数值*/
break;
}
}
if(strcmp(s,"memory")!=0)
aa[len++] = res;/*入数组*/
else
price = res;/*记录memory店的价格*/
}
for (i=0;i<len;i++)
{
if(price<aa[i])
count++;
}
printf("%d/n",count+1);
}
}
return 0;
}