Chef and Division 3 Codechef january challenge solution || Chef and Division 3 Codechef january challenge Editorial 2021
Chef and Division 3 Codechef january challenge solution || Chef and Division 3 Codechef january challenge Editorial- Problem statement- Chef wants to host some Division-3 contests. Chef has N N setters who are busy creating new problems for him. The i t h i t h setter has made A i A i problems where 1 ≤ i ≤ N 1 ≤ i ≤ N . A Division-3 contest should have exactly K K problems. Chef wants to plan for the next D D days using the problems that they have currently. But Chef cannot host more than one Division-3 contest in a day. Given these constraints, can you help Chef find the maximum number of Division-3 contests that can be hosted in these D D days? Input: The first line of input contains a single integer T T denoting the number of test cases. The description of T T test cases follows. The first line of each test case contains three space-separated integers - N N , K K and D D respectively. The second line of each test case contains N N space-separated inte