Choosing Teams

最新推荐文章于 2025-10-13 20:26:23 发布

原创最新推荐文章于 2025-10-13 20:26:23 发布 · 398 阅读

0 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

探讨了Saratov州立大学程序设计培训中心如何根据队员过往参与ACM国际大学生程序设计竞赛的经历来最大化组建能在至少k次比赛中保持不变的三人民间团队的数量。

Description

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: y₁, y₂, ..., y_n(0 ≤ y_i ≤ 5), where y_i 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 Input

Input

5 2
0 4 5 1 0

Output

Input

6 4
0 1 2 3 4 5

Output

Input

6 5
0 0 0 0 0 0

Output

Hint

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.

#include<iostream>
#include<algorithm>
using namespace std;

int main(){
    int num,n,k;
    int str[2010];
    while(cin>>n>>k){
        for(int i=0;i<n;i++){
            cin>>str[i];
        }
        sort(str,str+n);
        num=0;
        for(int i=2;i<n;i+=3){
            if((str[i]+k)<=5){
                num++;
            }
            else{
                break;
            }
        }
        cout<<num<<endl;
    }
    return 0;
}