题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1263
该题我我们可以用map来做,只是我们需要用一个结构体来嵌套一个map;
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int Max = 0x3f3f3f3f;
const int Min = 0xc0c0c0c0;
const int maxn = 123456;
#define mst(a) memset(a,0,sizeof(a))
#define w(i) while(i--)
#define forij(i,j,k,step) for(int i=k;i<j;i+=step)
int t,n,m;
struct Node
{
map<string,int> name;
};
int main()
{
map<string, Node> add;
map<string,Node>:: iterator its;
map<string,int>:: iterator it;
string s1,s2;
cin>>n;
while(n--)
{
add.clear();
int m,num;
cin>>m;
for(int i=0; i<m; i++)
{
cin>>s1>>s2>>num;
add[s2].name[s1]+=num;//统计销售数目
}
for(its=add.begin(); its!=add.end(); its++)
{
cout<<its->first<<endl;
for(it=its->second.name.begin(); it!=its->second.name.end(); it++)
{
cout<<" |----"<<it->first<<"("<<it->second<<")"<<endl;
}
}
if(n!= 0)//输出格式
{
cout<<endl;
}
}
return 0;
}