hdu 1263 水果

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct biaoge
{
    char name[100];
    char place[100];
    int num;
}a[105];
bool cmp(biaoge x,biaoge y)
{
    if (strcmp(x.place,y.place)!=0)
	return strcmp(x.place,y.place)<0;
    if (strcmp(x.name,y.name)!=0&&strcmp(x.place,y.place)==0)
	return strcmp(x.name,y.name)<0;
}
int main()
{
    int n,m,i,j,k;
    int b[105],p[105],c[105];
    char t[100];
    scanf("%d",&n);
    while (n--)
    {
        scanf("%d",&m);
        for (i=0;i<m;i++)
            scanf("%s %s %d",a[i].name,a[i].place,&a[i].num);
        sort(a,a+m,cmp);
        memset(b,0,sizeof(b));
        memset(p,0,sizeof(p));
        memset(c,0,sizeof(c));
        for (i=0;i<m;i++)
            for (j=i+1;j<m;j++)
             {
             	if (strcmp(a[i].place,a[j].place)==0&&c[i]!=1)
                    c[j]=1;
                if (strcmp(a[i].place,a[j].place)==0&&strcmp(a[i].name,a[j].name)==0&&b[i]!=1)
                {
                    p[i]+=a[j].num;
                    b[j]=1;
                }
             }   
        b[0]=0;
        for (i=0;i<m;i++)
        {
            if (c[i]!=1)
            {
                printf("%sn",a[i].place);
            }
            if (b[i]!=1)
            {
                printf("   |----%s(%d)n",a[i].name,a[i].num+p[i]);
            }
        }
        if (n!=0)
            printf("n");
    }
    return 0;
}