AtCoder - D Zabuton - Interesting Zabuton Stacking Problem Solved Using Sorting & Priority Queue

AtCoder - D Zabuton - Interesting Zabuton Stacking Problem Solved Using Sorting & Priority QueueAtCoder - D Zabuton - Interesting Zabuton Stacking Problem Solved Using Sorting & Priority Queue

If you find this video helpful, please 'Like' & 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.

Problem Link : https://atcoder.jp/contests/cf17-final/tasks/cf17_final_d

Problem Description:

In the final of CODE FESTIVAL in some year, there are N participants. The height and power of Participant i is H
i and Pi, respectively.

Ringo is hosting a game of stacking zabuton (cushions).

The participants will line up in a row in some order, and they will in turn try to add zabuton to the stack
of zabuton. Initially, the stack is empty. When it is Participant i's turn, if there are Hi or less zabuton already stacked, he/she will add exactly Pi zabuton to the stack. Otherwise, he/she will give up and do nothing.

Ringo wants to maximize the number of participants who can add zabuton to the stack. How many participants can add zabuton to the stack in the optimal order of participants?

Youtube channel: https://www.youtube.com/channel/UCrvpRH4lSRjp2T6btl0lf4w

https://github.com/maksrane100/codeforces_solutions
https://github.com/maksrane100/leetcode_solutions

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #Preparation
#interview #programminglife #programmingisfun #atcoder #leetcode #codeforces #algorithm #algorithms #datastructure #datastructuresandalgorithms