zoj3875 Lunch Time(水,但有意思)
来源:互联网 发布:mysql数据库入门书籍 编辑:程序博客网 时间:2024/06/15 15:36
为什么一道水题能给我成就感呢?大概是因为越来越会玩结构体了
#include <stdio.h>#include <algorithm>#include <iostream>#include <queue>#include <string.h>using namespace std;const int N = 200;const int INF = 1000000;struct FOOD{ char name[N]; int w;};bool cmp(FOOD x, FOOD y){ return x.w < y.w;}int main(){ // freopen("in.txt", "r", stdin); int T, s, m, d; scanf("%d", &T); while(T --) { FOOD f1[N], f2[N], f3[N]; scanf("%d%d%d", &s, &m, &d); for(int i = 0; i < s; i ++) { cin >> f1[i].name; scanf("%d", &f1[i].w); } sort(f1, f1 + s, cmp); for(int i = 0; i < m; i ++) { cin >> f2[i].name; scanf("%d", &f2[i].w); } sort(f2, f2 + m, cmp); for(int i = 0; i < d; i ++) { cin >> f3[i].name; scanf("%d", &f3[i].w); } sort(f3, f3 + d, cmp); /* for(int i = 0; i < m; i ++) { printf("%s %d\n", f2[i].name, f2[i].w); }*/ // printf("%d\n", (m - 1) / 2 + 1); FOOD tmp1, tmp2, tmp3; tmp1 = f1[s / 2]; tmp2 = f2[m / 2]; tmp3 = f3[d / 2]; int ans = tmp1.w + tmp2.w + tmp3.w; // printf("%s\n", f2[1].name); printf("%d %s %s %s\n", ans, tmp1.name, tmp2.name, tmp3.name); } return 0;}
0 0
- zoj3875 Lunch Time(水,但有意思)
- ZOJ3875:Lunch Time(浙江省赛2015)
- ZOJ 3875 Lunch Time(水)
- ZOJ - 3875 Lunch Time (模拟)水
- Lunch Time
- Lunch Time
- Lunch Time
- HDU 4807 Lunch Time(费用流)
- hdu 4807 Lunch Time
- HDU 4807 Lunch Time
- hdu 4807 Lunch Time
- lunch time food
- zoj 3875 Lunch Time
- ZOJ 3875 Lunch Time
- ZOJ 3875 Lunch Time
- ACM-水题 Lunch Time
- zoj Lunch Time 3875
- ZOJ - 3875-Lunch Time
- 让多个Fragment 切换时不重新实例化
- 弱网络下的游戏服务器设计
- bzoj 1189(拆点最大流)
- 文章标题
- 【LeetCode】171. Excel Sheet Column Number && 168. Excel Sheet Column Title
- zoj3875 Lunch Time(水,但有意思)
- Codeforces 630F - Selection of Personnel
- POJ_P2311 Cutting Game(博弈+SG函数)
- C++中的继承和组合区别使用
- ZOJ 3926Parity Modulo P(XJB)
- wait和notifyAll的方法使用案例分析
- Retrofit 代替 HttpRequest
- SpringMVC入门示例(二)
- 第二周项目一 宣告“主权”