Problem: 1293A - ConneR and the A.R.C. Markland-N
Please help with the solution to this problem
Are you sure you got the problem right?
Edit: nvm
Brute force
Iterate for all values on right, and left till you find a valid one.
Now you may think this would be a TLE, but since K is less than 1000 you’ll at max doing 1000 checks before you get a valid one