Watching CPL WIPL SOLUTION Code Chef

Watching CPL WIPL SOLUTION Codechef

Get excited, folks, because it is time for the final match of Codechef Premier League (CPL)!

Mike and Tracy also want to watch the grand finale, but unfortunately, they could not get tickets to the match. However, Mike is not someone who gives up so easily — he has a plan to watch the match. The field where the match is played is surrounded by a wall with height K. Outside, there are N boxes (numbered 1 through N). For each valid i, the i-th box has a height Hi.

Mike wants to take some boxes and stack them on top of each other to build two towers. The height of each tower is the sum of heights of all the boxes that form it. Of course, no box may be in both towers. The height of each tower should be at least K. Then Mike can climb on top of one tower and Tracy on top of the other, and they can watch the match uninterrupted!

While Mike is busy stacking the boxes, Tracy would like to know the smallest number of boxes required to build two towers such that each of them has height at least K, or at least that it is impossible to build such towers. Can you help Tracy?


The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.

The first line of each test case contains two space-separated integers N and K.

The second line contains N space-separated integers H1,H2,…,HN.


For each test case, print a single line containing one integer — the smallest number of boxes required to build two towers, or −1 if it is impossible.




1≤Hi≤105 for each valid i


Subtask #1 (30 points):


1≤Hi≤100 for each valid i

Subtask #2 (70 points): original constraints

Example Input


8 38

7 8 19 7 8 7 10 20

4 5

2 10 4 9

Example Output




  • Example case 1: The first tower can be built with boxes 8+10+20=38 and the second tower with boxes 7+7+8+19=41. In this case, the box with height 7 is left unused.
  • Example case 2: We only need the box with height 10 for one tower and the box with height 9 for the other tower.

Click Here to Download : Please Click HERE


Program Python:

t = int(input())
for _ in range(t):
    n,k = list(map(int, input().split()))
    h = list(map(int, input().split()))
    sum = h[0]
    s1 = set()
    res = -1
    for i in range(1, len(h)):
        s2 = set()
        for ele in s1:
            if (ele >=k  and sum - ele) >=k or (ele + h[i] >= k and sum - ele - h[i] >= k):
                res = i
            s2.add(ele + h[i])
        if res != -1:
        s1 = s2
    if res == -1:

Program Java:

import java.util.*;
import java.lang.*;
/* Name of the class has to be "Main" only if the class is public. */
class Codechef
    static Integer arr[];
    static int dpMap[][];
    public static void main(String[] args) throws Exception{
        BufferedReader br =new BufferedReader(new InputStreamReader(;
        int t = Integer.parseInt(br.readLine().trim());
        int ret[] = new int[t];
        for(int i = 0 ;i < t; i++){
            int[] con = Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
            arr = Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).boxed().toArray(Integer[] ::new);
            Arrays.sort(arr,(a,b) -> b-a);
            dpMap = new int[con[0]+1][con[1]+500];
            int t1 = 0, t2 = 0;
            int res = dpSolve(t1,t2,con[1],0);
            if(res == Integer.MAX_VALUE) ret[i] = -1;
            else ret[i] = res;

        for(int i:ret) System.out.println(i);

    static int dpSolve(int t1, int t2, int k, int i){

        if(t1 >= k){
            if(t2 >= k) return i;
            else return Integer.MAX_VALUE;
        if(i >= arr.length) return Integer.MAX_VALUE;

        if(dpMap[i][t1] != 0) return dpMap[i][t1];
        dpMap[i][t1] = Math.min(dpSolve(t1+arr[i] , t2, k, i+1), dpSolve(t1, t2+arr[i], k, i+1));
        return dpMap[i][t1];

Program C++:

using namespace std;
#define mod  1000000007    
void solve() {
    int n, k;
    cin >> n >> k;

    vector<int> arr(n);
    vector<int> pref(n);
    for ( int i=0; i<n; i++ ) {
        cin >> arr[i];
        arr[i] = min(arr[i], k);

    sort(arr.begin(), arr.end(), greater<int>() );

    pref[0] = arr[0];
    for ( int i=1; i<n; i++ ) pref[i] = pref[i-1] + arr[i];

    vector<int> mp(2*k + 1, 0);
    mp[0] = 1;

    for ( int i=0; i<n; i++ ) {
        vector<int> mp1 = mp;

        for ( int j=0; j <= 2*k; j++ ) {
            if ( j - arr[i] >= 0 && mp[j - arr[i]] ) {
                mp1[j] = 1;
                if ( j >= k && pref[i] - j >= k ) {
                    cout << i + 1 << '\n';

        mp = mp1;

    cout << -1 << '\n';
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    cin >> tc;
    while( tc-- ) {

January Long Challenge 2021

2 thoughts on “Watching CPL WIPL SOLUTION Code Chef”

Leave a Comment

eighteen − ten =