HDU - 1263 水果

https://vjudge.net/problem/HDU-1263

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map> 
using namespace std;
int T;
int main()
{
	cin>>T;
	while(T--)
	{
		int n,sum;
		string place,fruit;
		map<string,map<string,int>> q;
		cin>>n;
		for(int i=0;i<n;i++)
		{
			cin>>fruit>>place>>sum;
			q[place][fruit]+=sum;
		}
		for(auto i:q)
		{
			string pl=i.first;
			cout<<pl<<"\n";
			for(auto j:i.second)
			{
				string fr=j.first;
				cout<<"   |----"<<fr<<"("<<j.second<<")"<<"\n";
			}
		}
		if(T)
			cout<<"\n";
	}
	return 0;
 } 

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<map>
using namespace std;
map<string,int> xx;
int main()
{
//	freopen( "out.txt", "w", stdout );
	int n,m,c;
	char a[110],b[110];
	cin>>n;
	while(n--)
	{
		struct st{
			int f=-1;
			int g=-1;
			map<string,int>x;
		}p[110];
		
		xx.clear();
		cin>>m;
		for(int i=0;i<m;i++)
		{
			scanf("%s %s %d",b,a,&c);
			if(xx.count(a)==0) 
				xx[a]=i;
						
			if(p[xx[a]].f==-1)
			{
				p[xx[a]].x[b]=0;
				p[xx[a]].f=1;
			}
			p[xx[a]].x[b]+=c;			
		}

		map<string,int>::iterator it;
		int w=0;
		for(it=xx.begin();it!=xx.end();it++)
		{
			int t=it->second,h=0;
			cout<<it->first<<endl;
			map<string,int> :: iterator iit;
			for(iit=p[t].x.begin();iit!=p[t].x.end();iit++)
			{
				h++;
				cout<<"   |----"<<iit->first<<"("<<iit->second<<")";
				if(h!=p[t].x.size()) 
					cout<<endl;
			}
			w++;
			if(w!=xx.size())
				cout<<endl;
		}
		cout<<endl;
		if(n!=0)
		cout<<endl;
	}
}