POJ2403 Hay Points

匹配

初学 代码太杂糅

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;struct word{    char name[20];    int  num;};word am[1010];int i,j;int sum=0;int m,n;char tag[20];int main(){    //freopen("in.txt","r",stdin);    scanf("%d%d",&m,&n);    for(i=0;i<m;i++)    {        scanf("%s",am[i].name);        scanf("%d",&am[i].num);    }    for(i=0;i<n;i++)    {        sum = 0;        while(scanf("%s",tag))        {            if(!strcmp(tag,"."))              {                  printf("%d\n",sum);                  break;              }            for(j=0;j<m;j++)                if(!strcmp(tag,am[j].name))                    sum += am[j].num;        }    }    return 0;}