Ajay Rajnikanth - Bookshelves

#include<iostream>
#include<algorithm>
#include<vector>

typedef long long ll;
using namespace std;

void xcv(ll &a,ll &b)
{
    ll temp;
    temp=a;
    a=b;
    b=temp;
}
int main()
{
    ll n,k,i,skew;
    cin>>n>>k;
    vector<ll>s1(n),s2(n);
    for(i=0;i<n;i++)
    {
        cin>>s1[i];
    }
    for(i=0;i<n;i++)
    {
        cin>>s2[i];
    }
    sort(s1.begin(),s1.end());
    sort(s2.begin(),s2.end());
    if(s1[n-1]<s2[n-1])
    {
        for(i=1;i<=k;i++)
        {
            if(s1[n-1]>s2[0])
            {
                // cout<<"The values= "<<s2[0]<<" "<<s1[n-1]<<endl;
                xcv(s1[n-1],s2[0]);
                sort(s1.begin(),s1.end());
                sort(s2.begin(),s2.end());
                //cout<<"The values= "<<s2[0]<<" "<<s1[n-1]<<endl;
            }
            else break;
        }
    }
    else
    {
        for(i=1;i<=k;i++)
        {
            if(s2[n-1]>s1[0])
            {
                //cout<<"The values= "<<s1[0]<<" "<<s2[n-1]<<endl;
                xcv(s2[n-1],s1[0]);
                sort(s1.begin(),s1.end());
                sort(s2.begin(),s2.end());
                //cout<<"The values= "<<s1[0]<<" "<<s2[n-1]<<endl;
            }
            else break;
        }
    }
    skew=s1[n-1]+s2[n-1];
    cout<<skew;
}