Oh yes! So the N log N solution is the intended one :)

And oh yes, definitely! We had the heaps DS as a part of our course last semester, but I guess this is the first time i'm practically solving a CP problem using their STL version of Priority Queues!

And I really would like to thank you for your patience in replying to all of my queries bro! Cheers!

EDIT1: Got AC with a very brute solution(the test cases seem to be pathetically weak (K*N*log N solution passed, pppffft). Any help for a linear solution would be much appreciated :)

EDIT2: Heap-based solution reduced complexity to N log N + K log N :) Brainstormed with my friends to come up with this approach. Still, a linear solution hasn't come to mind.

Many thanks for your valuable time, Keshav.

I'm sorry that I pasted only the main function, I didn't really anticipate that you'd inspect my code to that level.

As you said, the code doesn't pass even after the specific changes I made to pass subtask 1 and its very irritating. -_- I still don't understand how to solve this problem fully. Could you help me out with it? I guess this is one of the simplest mindbending problems I have ever come across. :'(

(I know I received a few hints from you, yet I can't fathom how to set about with solving it)

Hello Keshav, thank you for your reply.

I somehow keep facing difficulties to solve this problem. I set out to solve the basic subtask 1, where K=1.

Case 1:

If largest of first array is smaller than smallest of second array , swap and calculate the skew.

Case 2:

If largest of second array is smaller than smallest of first array , swap and calculate the skew.

This approach gives WA for all subtask #1. Please do help me out.

int n,k;
	cin>>n>>k;
int a[n], b[n];
for(int i=0; i<n; i++) cin>>a[i];
for(int i=0; i<n; i++) cin>>b[i];
	sort(a,a+n);

I need help solving the problem. I tried comparing the max element of an array and minimum element of another array and swap correspondingly for the answer, but it gives WA for too many cases. Could someone give a more detailed approach to this problem?