Educational Codeforces Round 140 Div 2 | Problem B : Block Towers Solution | Newton School

[@KaranMashru]

(Subscribe for more such videos)
Code :
#include
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

ll t, n, i, j;

cin>>t;

for(;t--;)
{
cin>>n;

ll a[n];

for(i=0; i>a[i];
}

sort(a+1, a+n);

for(i=1; ia[0]){
if((a[i]+a[0])%2==0){
a[0]=(a[i]+a[0])/2;
}else{
a[0]=(a[i]+a[0])/2+1;
}
}
}

cout

[@subhambhakat3908]

I guess todays problem D was lower than a B level proble.What the hell was problem C!!!!!!

[@Nikhilsainiharidwar]

Problem C

[@codingcommunitynewtonschoo8582]

Probably tomorrow...

[@QueenOfEvil-2]

why time complexity is o(nlogn)?

[@DIVYANSCKASHYAP]

due to sort fn. used

[@Now_I_am_all_fired_up]

Sir Problem A

[@anwar-cse]

Good! But if you speak in English, it will be more understandable for us.

[@SDE-wq4tl]

Upload D fast

[@codingcommunitynewtonschoo8582]

Coming soon ! I hope you enjoy it !

[@deepakjoshi4318]

pura array kyu sort nhi kia?

[@codingcommunitynewtonschoo8582]

Bcoz when we are doing operation, one index should be 0 always, and from remaining 1 to n-1 indexes we pick the bricks and drop on index 0 as we are asked to make index 0 with max bricks possible. So we need 1 to n-1 sorted. I hope you got my point.

[@deepakjoshi4318]

@@codingcommunitynewtonschoo8582 yes got it thanks

[@sagekikitchen6958]

D daaldo bhai pls

[@codingcommunitynewtonschoo8582]

Will be uploaded by 1-1:30...

[@owaissiddiquei3733]

Problem C

[@codingcommunitynewtonschoo8582]

Probably tomorrow...