Codeforces #246 (Div. 2) A. Choosing Teams

本文探讨了根据学生参加ACM国际大学生程序设计竞赛次数来组建参赛团队的问题。目标是在考虑每人最多参赛五次的限制下,形成能在未来至少k次比赛中保持不变的最多三人员团队。

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

                                                          A. Choosing Teams


time limit per test
 1 second
memory limit per test
 256 megabytes
input
 standard input
output
 standard output

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.

Sample test(s)
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.


解题说明:此题就是判断一列数中每个数都加上一个固定值后不大于5的数有多少,遍历即可。

  1. #include<iostream>  
  2. #include<cstdio>  
  3. #include<cmath>  
  4. #include<cstdlib>  
  5. #include <algorithm>  
  6. #include<cstring>  
  7. #include<string>  
  8. using namespace std;  
  9.   
  10. int main()  
  11. {  
  12.     int n, k,i,temp,count=0,answer=0;  
  13.     int a[2001];  
  14.     scanf("%d %d", &n, &k);  
  15.     for (i = 0; i < n; i++)  
  16.     {  
  17.         scanf("%d", &temp);  
  18.         a[i] = temp + k;  
  19.     }  
  20.     for (i = 0; i < n; i++)  
  21.     {  
  22.         if (a[i] <= 5)  
  23.         {  
  24.             count++;  
  25.         }  
  26.         if (count == 3)  
  27.         {  
  28.             count = 0;  
  29.             answer++;  
  30.         }  
  31.     }  
  32.     printf("%d\n", answer);  
  33.     return 0;  
  34. }  
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值