organize a team

4413. organize a team

Given n It's an integer y1,y2,…,yn, And an integer k.

First find out how many yi Satisfy yi+k≤5, Then output the data that meets the requirements yi Number of divided by 3 Rounded down value .

Input format

The first line contains two integers n and k.

The second line contains n It's an integer y1,y2,…,yn.

Output format

An integer , Answer .

Data range

front  4  Test points meet  1≤n≤6.
All test points meet  1≤n≤2000 1≤k≤5 0≤yi≤5.

sample input 1：

5 2
0 4 5 1 0

sample output 1：

1

sample input 2：

6 4
0 1 2 3 4 5

sample output 2：

0

sample input 3：

6 5
0 0 0 0 0 0

sample output 3：

2

The question is AcWing The first 49 The first question of the week , The difficulty is not so high , It can be done without Algorithm .

First light code ：

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

    The whole code is very short , Only 15 OK, it's so short , In the input a[i] You can start recording and k The sum is less than or equal to , You don't have to use one later for Loop to calculate , It's a waste of time , Finally, output the record directly （sum） Divide 3 That's it , because int Variable to divide, the default is to round down , There's no need for that trouble ！ 

  too I'll explain the second question later , Thank you. .