Jesse and Cookies

Problem Statement :

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with:

sweetness  Least sweet cookie   2nd least sweet cookie).

He repeats this procedure until all the cookies in his collection have a sweetness > =  K.
You are given Jesse's cookies. Print the number of operations required to give the cookies a sweetness > = K . Print -1 if this isn't possible.

Input Format

The first line consists of integers N, the number of cookies and K, the minimum required sweetness, separated by a space.
The next line contains N integers describing the array A  where Ai is the sweetness of the ith cookie in Jesse's collection.

Output Format

Output the number of operations that are needed to increase the cookie's sweetness > = K.
Output -1 if this isn't possible.

Solution :


                            Solution in C :

In C ++ :

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

#include <queue>

using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int n, k, operations = 0;;
    cin >> n;
    cin >> k;
    priority_queue<int> p;
    for (int a = 0; a < n; a++) {
        int cookie;
        cin >> cookie;
        p.push(cookie * -1);
    while ( > k * -1 && p.size() > 1) {
        int cookie1, cookie2, newCookie;
        cookie1 =;
        cookie2 =;
        newCookie = cookie1 + 2 * cookie2;
    if ( > k * -1) cout << "-1";
    else cout << operations;
    return 0;

In Java :

import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner scan=new Scanner(;
        int n=scan.nextInt();
        int k=scan.nextInt();
        PriorityQueue<Integer> queue=new PriorityQueue<Integer>();
        for(int i=0;i<n;i++)
        int count=0;
            int x=queue.remove();
            int y=queue.remove();

In C :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

long int n;
long int aa[1000002];
void siftdown(long int *a, long int n, long int start) {
    long int r, lch, swap, t;
    //printf("##%d %d##\n", start, a[start]);
    r = start;
    while (r * 2 <= n) {
        lch = 2 * r;
        swap = r;
        if (a[lch] < a[swap]) {
            swap = lch;
        if (lch+1 <= n && a[lch+1] < a[swap]) {
            swap = lch+1;
        if (swap == r) {
        } else {
            t = a[swap];
            a[swap] = a[r];
            a[r] = t;
            r = swap;

void heapify(long int *a, long int n)
    long int start;
    start = n/2;
    while (start >= 1) {
        siftdown(a, n, start);
        start --;
      //  print();
void print(long int *a) {
    long int i;
    for (i = 1; i <= n; i++)
        printf("%ld ", a[i]);
int main() {
    long int k, i, t, *a, tmp;
    scanf("%ld%ld", &n, &k);
    for(i = 1; i <= n; i++)
        scanf("%ld", &aa[i]);
//   print(aa);
    t = 0;
    heapify(aa, n);
//    print(aa);
    a = &aa[0];
    while (1) {
   //     print();
        if (a[1] >= k) 
        if (n == 2) {
            if (a[1] < a[2]) {
                a[1] = a[1] + 2 * a[2];
            } else {
                a[1] = a[2] + 2 * a[1];
        if (n == 1)
        if (a[2] < a[3]) {
            a[2] = a[1] + 2*a[2];
            siftdown(a, n, 2);
        } else {
            a[3] = a[1] + 2*a[3];
            siftdown(a, n, 3);
        a[1] = a[n];
        siftdown(a, n, 1);
      // print(a);
    if (a[1] < k)
    printf("%ld\n", t);
   // print();
    return 0;

In python3 :

import heapq
n, s = [int(i) for i in input().split()]
cookies = [int(i) for i in input().split()]
ops = 0
while (cookies[0] < s):
        ops += 1
        cookie1 = heapq.heappop(cookies)
        cookie2 = heapq.heappop(cookies)
        newcookie = 1*cookie1 + 2*cookie2
        heapq.heappush(cookies, newcookie)
    except IndexError:
        ops = -1

View More Similar Problems

Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →

Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →

Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →

Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →

Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →