C. Slay the Dragon | Codeforces Educational Codeforces Round 114 (Div. 2) | sKSama Hindi Editorial

Telegram- bit.ly/30jGLHZ
Register - www.credit-sui...
PROMO - sKSama
Please Use Promo Code - sKSama
(Case Sensitive) for an engagement point
C-
Question - codeforces.com...
Soluchan -codeforces.com...
If you wish to donate & support my work -
UPI id - sksama@upi
Or Scan to Donate - bit.ly/36eJLYk
Essential Maths for Competitive Programming C++ - practice.geeks...
USE CODE - SKSAMAGFG
for FLAT 10% off on all Geeks For Geeks Courses- practice.geeks...
Linkedin- / sksamayt
Instagram- / sksamayt
Few Courses to checkout-
DSA Course-practice.geeks...
Interview Prep Course - practice.geeks...
#sksama #codeforces #codechef #div2 #solution #explanation #gfg

[@sKSama]

Register - www.credit-suisse.com/pwp/hr/en/codingchallenge/#/howtoplay/?promocode=sKSama PROMO - sKSama Please Use Promo Code - sKSama (Case Sensitive) for an engagement point

[@user-ti7jb6xp4n]

Best Explanation thanku bhaiya

[@SouravKumar-rg4yj]

sir please try to upload just problem C of codeforces round if you have free time ...

[@lakshyakhushalani9464]

sir,,maine multiset se kia thaa....6th case mai TLE aa gya....mai debug nahi kr paa raha mistake kya haii ???? #include using namespace std; #define int long long #define wtt \ int ttt; \ cin >> ttt; \ while (ttt--) #define f(i, n) for (int i = 0; i < n; i++) #define vec vector #define all(x) x.begin(), x.end() void solve() { int n; cin >> n; multiset s; int sum = 0; f(i, n) { int x; cin >> x; s.insert(x); sum += x; } int m; cin >> m; while (m--) { int x, y; cin >> x >> y; int ans = 0, ans1 = 0; int player1, player2; auto it = s.lower_bound(x); if (it == s.end()) { it--; player1 = *it; ans = ans + x - player1; if ((sum - player1) < y) ans += y - (sum - player1); cout

[@namitgupta352]

Bro u are best. Amazing explanation in Hindi. So polite, slow and steady teaching.

[@Fictional_universe]

After long time you are back, plz keep it up, your explanation iz sooo much easier than anyone.

[@ZuleyenineIbneNoman]

Great explanation dear brother ☺️ Thanks a ton.

[@Shailswap14]

amazing explaination

[@hrithik7354]

Nice explanation

[@aryanverma7800]

Sir plz work on your microphone, it is not audible without earphones on laptop...you can check it

[@anweshakumar7838]

👌👌👌

[@abhishekgupta9705]

will O(n*m) work in this question??

[@anshshah4927]

Nope

[@abhishekgupta9705]

@@anshshah4927 ok thanks