8237: CF1133 - E. K Balanced Teams
[Creator : ]
Description
You are a coach at your local university. There are n students under your supervision, the programming skill of the i-th student is $a_i$.
You have to form k teams for yet another new programming competition. As you know, the more students are involved in competition the more probable the victory of your university is! So you have to form no more than k (and at least one) non-empty teams so that the total number of students in them is maximized. But you also know that each team should be balanced. It means that the programming skill of each pair of students in each team should differ by no more than 5. Teams are independent from one another (it means that the difference between programming skills of two students from two different teams does not matter).
It is possible that some students not be included in any team at all.
Your task is to report the maximum possible total number of students in no more than k (and at least one) non-empty balanced teams.
You have to form k teams for yet another new programming competition. As you know, the more students are involved in competition the more probable the victory of your university is! So you have to form no more than k (and at least one) non-empty teams so that the total number of students in them is maximized. But you also know that each team should be balanced. It means that the programming skill of each pair of students in each team should differ by no more than 5. Teams are independent from one another (it means that the difference between programming skills of two students from two different teams does not matter).
It is possible that some students not be included in any team at all.
Your task is to report the maximum possible total number of students in no more than k (and at least one) non-empty balanced teams.
Input
The first line of the input contains two integers $n, k\ (1≤k≤n≤5000)$ — the number of students and the maximum number of teams, correspondingly.
The second line of the input contains $n$ integers $a_1,a_2,…,a_n\ (1≤a_i≤10^9)$, where $a_i$ is a programming skill of the i-th student.
The second line of the input contains $n$ integers $a_1,a_2,…,a_n\ (1≤a_i≤10^9)$, where $a_i$ is a programming skill of the i-th student.
Output
Print one integer — the maximum possible total number of students in no more than k (and at least one) non-empty balanced teams.
Sample 1 Input
5 2
1 2 15 15 15
Sample 1 Output
5
Sample 2 Input
6 1
36 4 1 25 9 16
Sample 2 Output
2
Sample 3 Input
4 4
1 10 100 1000
Sample 3 Output
4
HINT
相同题目：CF1133。