PBDS Implementation issue

#1

Getting compilation error into this code of PBDS. Please rectify. I have implemented using the approach by Apaar bhaiyya

Problem link - https://codeforces.com/contest/1324/problem/D

Code link- https://ide.codingblocks.com/s/214646

#2

Hi @TheUnmaskedDive
refer to dis code.


i hv just found the upper bound of -c[i].
like we want a+b>c+d —> (a-c)+(b-d)>0
so we know a-c, we find what to add in (a-c) such that it become >0 hence i have used upper bound.
Hope dis helps.

#3

In ur code, u r inserting pair but trying to find order of integer.
thats why u were getting compilation error.
Hope dis helps.

#4

@TheUnmaskedDive
refer to dis code too.


this is ur updated code