hdu 1263水果（map）

#include <cstdio> #include <cstring> #include <string> #include <algorithm> #include <queue> #include <map> #include <cmath> #include <iostream> #define INF 0x3f3f3f3f using namespace std; map<string,int> di,shui; int a[105][105]={0}; int main() { char s1[100],s2[100]; int t; scanf("%d",&t); for(int cas=1;cas<=t;cas++) { memset(a,0,sizeof(a)); di.clear(); shui.clear(); int m,cnt1,cnt2; cnt1=cnt2=0; scanf("%d",&m); for(int i=0;i<m;i++) { int num; scanf("%s%s%d",s1,s2,&num); if(!di.count(s2)) di[s2]=++cnt1; if(!shui.count(s1)) shui[s1]=++cnt2; a[di[s2]][shui[s1]]+=num; } for(map<string,int>::iterator it1=di.begin();it1!=di.end();it1++) { cout<<it1->first<<endl; for(map<string,int>::iterator it2=shui.begin();it2!=shui.end();it2++) { if(a[it1->second][it2->second]) { printf(" |----"); cout<<it2->first; printf("(%d)\n",a[it1->second][it2->second]); } } } if(t!=cas) puts(""); } }