I think this technique is known as Sorting based on Exchange Arguments.

For the Box Stacking Question My approach : Reverse sort the boxes based on their weight carrying capacity Then, take greedily untill the weight carrying capacity of the box at the base becomes 0. Am I correct ?

For Programmer and Artist Selection. My approach : We can use two multisets one for programmer and another for artist and select the Top a from one and Top b from another.

Your problem statements are pathetic

atleast give a proper problem statement

yes bro , if they highlighted the lattice points it would have been better to understand lol

what kind of question is the first one

This movie doesn't have a realtion with CP at all.

This one solved my problem . Hail to the old gods and new.

Using n,m<=1e3 . Even a O(n^2) solution can pass ,still the approach will remain same

cant Problem E be done in this way ?

We first calculate the upper bound of each K in the array a

Then ans = prefix_sum[location of upper_bound of K — 1]

Please help me if I am getting something wrong

LOL! Why the editorials are super unhelpful along with weird syntax

Wow so fast tutorials .Great Contest .Problems were great . Thank u :)

No , I guess

whats dat?

Why is the second question giving TLE for an O(t*N) algorithm ,wierd!!

oh wow

lmfao

Bro, whats in Dhaka?

All solutions of Mike Mirzayanov are so complex!!!

yea ,good luck bro

wth , 2 days ;( This is intolerable,ughhh. Wish the ratings comes within today :(

how do you know ?

when will be the results declared ?