选人参加比赛

最新推荐文章于 2024-04-22 17:09:16 发布

Chen xiao li

最新推荐文章于 2024-04-22 17:09:16 发布

阅读量177

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/weixin_44002750/article/details/86675514

本文介绍了一道名为CodeForces-432A的编程题，题目要求根据每位队员的参赛次数，计算最多能组成多少支符合世界编程锦标赛规则的队伍。每支队伍需由三人组成，且每位队员在同一队伍中至少能参赛k次。通过分析每位队员剩余的参赛次数并除以3，得到最终答案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A - 1 CodeForces - 432A
The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students. For each student you know the number of times he/she has participated in the ACM ICPC world programming championship. According to the ACM ICPC rules, each person can participate in the world championship at most 5 times.

The head of the SSU OPTC is recently gathering teams to participate in the world championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?

Input
The first line contains two integers, n and k (1 ≤ n ≤ 2000; 1 ≤ k ≤ 5). The next line contains n integers: y1, y2, …, yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-th person participated in the ACM ICPC world championship.

Output
Print a single number — the answer to the problem.

Examples
Input
5 2
0 4 5 1 0
Output
1
Input
6 4
0 1 2 3 4 5
Output
0
Input
6 5
0 0 0 0 0 0
Output
2
Note
In the first sample only one team could be made: the first, the fourth and the fifth participants.

In the second sample no teams could be created.

In the third sample two teams could be created. Any partition into two teams fits.
题目大意：员工有n个人；每个人只能参加5次该种比赛；问这n个人可以租成多少个符合条件的队；教练知道每个人参加比赛的次数。
思路：由每个人已参加的次数可以知道还可以参加多少次，然后再除3；
代码如下（已AC）

#include<iostream>
using namespace std;
int main()
{
	int a, k;
	cin >> a >> k;
	int *p = new int[a];
	for (int i = 0; i < a; i++)
		cin >> p[i];
	int x = 0;
	for (int i = 0; i < a; i++)
		if (5 - p[i] >= k)
			x++;
	cout << x / 3 << endl;
	return 0;
}