Minimum sum of two elements from two arrays

problem id:--http://practice.geeksforgeeks.org/problems/minimum-sum-of-two-elements-from-two-arrays/0

code:--

#include <bits/stdc++.h>

using namespace std;
#define ll   long long
#define      pii               std::pair<int,int>
#define      vi                std::vector<int>
#define      vll               std::vector<long long>
#define      mp(a,b)           make_pair(a,b)
#define      pb(a)             push_back(a)
#define sc(x)   scanf("%d",&x)
#define scll(x)   scanf("%lld",&x)
#define sc2(x,y)   scanf("%d%d",&x,&y)
#define sc3(x,y,z)   scanf("%d%d%d",&x,&y,&z)
#define     pf(x)   printf("%d ",x)
#define     pf2(x,y)   printf("%d %d ",x,y)
#define     pf3(x,y,z)   printf("%d %d %d ",x,y,z)
#define pfnl()   putchar('\n');
#define      each(it,s)        for(auto it = s.begin(); it != s.end(); ++it)
#define      rep(i, n)         for(int i = 0; i < (n); ++i)
#define rep2(i,j,n)   for(int i = j; i < (n); ++i)
#define      fill(a)           memset(a, 0, sizeof (a))
#define      sortA(v)          sort(v.begin(), v.end())
#define      sortD(v)          sort(v.begin(), v.end(), greater<auto>())
#define      X                 first
#define      Y                 second

#define debug(x) cerr<<"debug->"<<#x<<"::"<<x<<endl
#define debug2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n"
#define debug3(x,y,z) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n"
#define MOD 1000000007

int main(int argc, char **argv) {
//std::ios::sync_with_stdio(false);
priority_queue<pair<int,int> > a,b;
int t;
sc(t);
while(t--)
{
int n,num;
sc(n);
a=priority_queue<pair<int,int> > ();
b=priority_queue<pair<int,int> > ();
rep(i,n) {sc(num); a.push(mp(-num,i));}
rep(i,n) {sc(num); b.push(mp(-num,i));}
int ans=0;
int num1=-a.top().X ,num2=-b.top().X;
if(a.top().Y !=b.top().Y)
   ans=num1+num2;
else
   {
   a.pop(); b.pop();
   ans=min(num1 - b.top().X , num2 - a.top().X);
   }
cout<<ans<<'\n';
}
return 0;
}