hdu2648（map+哈希）

典型的哈希算法

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#define mem(a,x) memset(a,x,sizeof(a))
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y)
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k)
#define ff(a,n) for(int i = 0 ; i < n; i++) scanf("%d",a+i)
#define tp(x) printf("x = %d\n",x)
#define ansp(x) printf("%d\n",x)
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;

const int mx = 1e4+10;
int n,m,id[mx],sum[mx],ob,pri;
map<string,int>ma;
string te;
int main(){
	//int T=10;	scanf("%d",&T);
//	freopen("F:\\in.txt","r",stdin); 
	
	while(scanf("%d",&n) != EOF){
		for(int i = 0; i < n; i++){
			cin>>te;
			ma[te] = i;
			if(te =="memory")
				ob = i; 
		}
	
		scanf("%d",&m);
		memset(sum,0,sizeof(sum));
		int tol;
		while(m--){
			tol = 0;
			for(int i = 0; i < n; i++){
				cin>>pri>>te;
				sum[ma[te]] += pri;
			}
			for(int i = 0; i < n; i++)
				if(sum[i] > sum[ob])
					tol++;
					
			printf("%d\n",tol+1);
		}
	}
	return 0;
}