ZOJ 3875 Lunch Time

题意：有三种菜的种类，挑出每种菜价格为中位数的菜，求出这三个菜的价格之和，输出这个值与三个菜名

链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5523

思路：排序，输出中位数和即可

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Problem ID	Language	Run Time(ms)	Run Memory(KB)	User Name
3945649	2015-04-26 22:58:15	Accepted	3875	C++0x	0	280	luminus

/* 
***********************************************
*# @Author  : Luminous11 (573728051@qq.com)
*# @Date    : 2015-04-26 22:51:26
*# @Link    : http://blog.csdn.net/luminous11
*********************************************** 
*/

#include <bits/stdc++.h>
#define clr(a, v) memset( a , v , sizeof(a) )
using namespace std;
const double eps = 1e-10;
const double pi = acos(-1.0);
struct node{
	char str[55];
	int val;
};
node num[105];
node ans1, ans2, ans3;
bool operator < ( const node &a, const node &b )
{
	return a.val < b.val;
}
int main()
{
	ios::sync_with_stdio ( false );
	int T;
	scanf ( "%d", &T );
	while ( T -- ){
		int a, b, c;
		scanf ( "%d%d%d", &a, &b, &c );
		for ( int i = 0; i < a; i ++ ){
			scanf ( "%s%d", num[i].str, &num[i].val );
		}
		sort ( num, num + a );
		ans1 = num[a/2];
		for ( int i = 0; i < b; i ++ ){
			scanf ( "%s%d", num[i].str, &num[i].val );
		}
		sort ( num, num + b );
		ans2 = num[b/2];
		for ( int i = 0; i < c; i ++ ){
			scanf ( "%s%d", num[i].str, &num[i].val );
		}
		sort ( num, num + c );
		ans3 = num[c/2];
		int sum = ans1.val + ans2.val + ans3.val;
		printf ( "%d %s %s %s\n", sum, ans1.str, ans2.str, ans3.str );
	}	
    return 0;
}