https://codeforces.me/contest/1783/problem/C

This is the link of the problem

https://codeforces.me/blog/entry/111194

This is the tutorial

In the editorial for problem C , why is it written we should check

m+b[ans-1]>=a[ans]

why is it depending on a , as it is not in any ordered pair , rather isn't it much logical that we will check with b[ans] that is it possible that instead of this we can switch it up with next element possible.

If anyone can help in pointing out where I am going wrong.

https://codeforces.me/contest/1906/problem/E

This is the link to the problem E of 2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC Rules, Teams Preferred) , can anyone help me in understanding the intuition and logic behind the dp approach of this problem. I cannot seem to grasp the logic behind the problem.

Any suggestion/idea maybe helpful too!!

Can anyone help me in figuring out the reason behind this runtime error

Here's my submission link : https://codeforces.me/contest/1850/submission/214987806