ZOJ 3875 Lunch Time

The 999th Zhejiang Provincial Collegiate Programming Contest will be held in Marjar University. The canteen of Marjar University is making preparations for this grand competition. The canteen provides a lunch set of three types: appetizer, main course and dessert. Each type has several dishes with different prices for choosing.

Edward is the headmaster of Marjar University. One day, to inspect the quality of dishes, he go to the canteen and decides to choose a median set for his lunch. That means he must choose one dish from each of appetizers, main courses and desserts. Each chosen dish should at the median price among all dishes of the same type.

For example, if there are five dessert dishes selling at the price of 2, 3, 5, 10, 30, Edward should choose the dish with price 5 as his dessert since its price is located at the median place of the dessert type. If the number of dishes of a type is even, Edward will choose the dish which is more expensive among the two medians.

You are given the list of all dishes, please write a program to help Edward decide which dishes he should choose.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains three integers S, M and D (1 <= S, M, D <= 100), which means that there are S dishes of appetizer, M dishes of main course and D dishes of dessert.

Then followed by three parts. The first part contains S lines, the second and the last part contains M and D lines respectively. In each line of the three parts, there is a string and an integer indicating the name and the price of a dish. The name of dishes will only consist of non-whitespace characters with no more than 50 characters. The price of dishes are non-negative integers less than or equal to 1000. All dish names will be distinct.

Output

For each test case, output the total price of the median set, together with the names of appetizer, main course and dessert, separated by a single space.

Sample Input

2
1 3 2
Fresh_Cucumber 4
Chow_Mein 5
Rice_Served_with_Duck_Leg 12
Fried_Vermicelli 7
Steamed_Dumpling 3
Steamed_Stuffed_Bun 4
2 3 1
Stir-fried_Loofah_with_Dried_Bamboo_Shoot 33
West_Lake_Water_Shield_Soup 36
DongPo's_Braised_Pork 54
West_Lake_Fish_in_Vinegar 48
Longjing_Shrimp 188
DongPo's_Crisp 18

Sample Output

15 Fresh_Cucumber Fried_Vermicelli Steamed_Stuffed_Bun
108 West_Lake_Water_Shield_Soup DongPo's_Braised_Pork DongPo's_Crisp

求每组甜点的中位数的和，如果有中位数有2组，取价格大的

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

struct zc
{
    char str[500];
    int s;
}r1[1000],r2[1000],r3[1000];

int cmp(zc a,zc b)
{
    return a.s<b.s;
}

int main()
{
    int T;
    int a,b,c;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&a,&b,&c);
        for(int i=1;i<=a;i++)
            scanf("%s %d",r1[i].str,&r1[i].s);
        for(int i=1;i<=b;i++)
            scanf("%s %d",r2[i].str,&r2[i].s);
        for(int i=1;i<=c;i++)
            scanf("%s %d",r3[i].str,&r3[i].s);
        sort(r1+1,r1+a+1,cmp);
        sort(r2+1,r2+b+1,cmp);
        sort(r3+1,r3+c+1,cmp);
        int sum=0;
        sum=sum+r1[(a/2)+1].s;
        sum=sum+r2[(b/2)+1].s;
        sum=sum+r3[(c/2)+1].s;
        printf("%d ",sum);
        printf("%s %s %s\n",r1[(a/2)+1].str,r2[(b/2)+1].str,r3[(c/2)+1].str);

    }
    return 0;
}