**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 (p.top() > k * -1 && p.size() > 1) {
int cookie1, cookie2, newCookie;
cookie1 = p.top();
p.pop();
cookie2 = p.top();
p.pop();
newCookie = cookie1 + 2 * cookie2;
p.push(newCookie);
operations++;
}
if (p.top() > k * -1) cout << "-1";
else cout << operations;
return 0;
}
In Java :
import java.io.*;
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(System.in);
int n=scan.nextInt();
int k=scan.nextInt();
PriorityQueue<Integer> queue=new PriorityQueue<Integer>();
for(int i=0;i<n;i++)
{
queue.add(scan.nextInt());
}
int count=0;
while(queue.peek()<k)
{
if(queue.size()>=2)
{
int x=queue.remove();
int y=queue.remove();
y=x+2*y;
queue.add(y);
count++;
}
else
{
count=-1;
break;
}
}
System.out.println(count);
}
}
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) {
return;
} 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]);
printf("\n");
}
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)
break;
if (n == 2) {
n--;
if (a[1] < a[2]) {
a[1] = a[1] + 2 * a[2];
} else {
a[1] = a[2] + 2 * a[1];
}
t++;
}
if (n == 1)
break;
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];
n--;
siftdown(a, n, 1);
t++;
// print(a);
}
if (a[1] < k)
printf("-1\n");
else
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()]
heapq.heapify(cookies)
ops = 0
while (cookies[0] < s):
try:
ops += 1
cookie1 = heapq.heappop(cookies)
cookie2 = heapq.heappop(cookies)
newcookie = 1*cookie1 + 2*cookie2
heapq.heappush(cookies, newcookie)
except IndexError:
ops = -1
break
print(ops)
```

## View More Similar Problems

## Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →## Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →## Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →## Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →## Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →