TLE for subtask 2

@vijju @swetankmodi
codenesia acenew:
for each i=0 to n j=i+1 to n checked for v[i]+v[j].why tle??
sol:`

The time limit is strict for your O({N}^{2}LogN) solution, which is additionally slowed due to use of vectors.

I will recommend seeing if removing vector helps or not. I suspect your code is taking somewhere ~3-11 seconds in worst case, so some hardware level optimisations are needed.

Suggest how to optimize it…

//