The 12th Zhejiang Provincial Collegiate Programming Contest - G

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct node
{
    int x;
    char c[1000];
};

int cmp(const node a,const node b)
{
    return a.x<b.x;
}

node aa[200],bb[200],cc[200];

int main()
{
    int t;
    int a,m,d;
    scanf("%d",&t);
    int fa,fb,fc;
    while(t--)
    {
        scanf("%d%d%d",&a,&m,&d);
        for(int i=1;i<=a;i++)
        {
            scanf("%s%d",aa[i].c,&aa[i].x);
        }
        sort(aa+1,aa+1+a,cmp);
        fa=a/2+1;
        for(int i=1;i<=m;i++)
        {
            scanf("%s%d",bb[i].c,&bb[i].x);
        }

        sort(bb+1,bb+1+m,cmp);
        fb=m/2+1;
        for(int i=1;i<=d;i++)
        {
            scanf("%s%d",cc[i].c,&cc[i].x);
        }
        sort(cc+1,cc+1+d,cmp);
        fc=d/2+1;
        printf("%d ",aa[fa].x+bb[fb].x+cc[fc].x);
        printf("%s %s %s\n",aa[fa].c,bb[fb].c,cc[fc].c);
    }
    return 0;
}