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

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 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

题意：大致意思是经过k次比赛后找出比赛次数小于5次的人数，然后在整除3就能找出队伍数
#include<stdio.h>
int main(){
	int n,k;
	int a[2001];
	int i,j,sum;
	while(scanf("%d %d",&n,&k)!=EOF){
		sum=0;
		for(i=0;i<n;i++)
		scanf("%d",&a[i]);
		for(i=0;i<n;i++){
		a[i]+=k;
		if(a[i]<=5)
		sum++;
		}
		printf("%d\n",sum/3);
	}
	return 0;
}