Jesse and Cookies

Problem Link

#Solution

#include <bits/stdc++.h>

using namespace std;

#define ll long long 

int main(){

int n,k;

cin>>n>>k;

priority_queue<int,vector<int>,greater<int> > pq;

for(int i=0;i<n;i++)

{ int x; cin>>x;

pq.push(x);

}

int count=0;

while(pq.top()1)

{ int c1=pq.top();

pq.pop();

int c2=pq.top();

pq.pop();

int r=c1+2*c2;

pq.push(r);

count++; }

if(pq.top()>=k) cout<<count;

else cout<<-1;

return 0; }

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Hackerrank, Uncategorized and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s