Codeforces--1221C--Perfect Team

最新推荐文章于 2020-04-14 23:00:24 发布

Ypopstar

最新推荐文章于 2020-04-14 23:00:24 发布

阅读量193

点赞数

分类专栏：算法数学

本文链接：https://blog.csdn.net/Ypopstar/article/details/104995835

版权

这是一篇关于Codeforces编程竞赛中1221C题目的解析文章。题目要求组建包含至少一名程序员和一名数学家的完美团队，每个团队有三人。给定程序员、数学家和无专业学生的数量，求最大能组建多少个完美团队。文章提供了输入输出描述、题目理解、解题思路和完整代码实现。

摘要由CSDN通过智能技术生成

题目描述：
You may have already known that a standard ICPC team consists of exactly three members. The perfect team however has more restrictions. A student can have some specialization: coder or mathematician. She/he can have no specialization, but can’t have both at the same time.
So the team is considered perfect if it includes at least one coder, at least one mathematician and it consists of exactly three members.
You are a coach at a very large university and you know that c of your students are coders, m are mathematicians and x have no specialization.
What is the maximum number of full perfect teams you can distribute them into?
Note that some students can be left without a team and each student can be a part of no more than one team.
You are also asked to answer q independent queries.
输入描述:
The first line contains a single integer q (1≤q≤104) — the number of queries.
Each of the next q lines contains three integers c, m and x (0≤c,m,x≤108) — the number of coders, mathematicians and students without any specialization in the university, respectively.
Note that the no student is both coder and mathematician at the same time.
输出描述:
Print q integers — the i-th of them should be the answer to the i query