My issue
hello
My code
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
long long int minimum1=LLONG_MAX,minimum=LLONG_MAX,minimum2=LLONG_MAX,same=0,not_same=0;
unordered_set<long long int>u;
long long int n;
cin>>n;
vector<long long int>v;
for(int i=0;i<n;i++){
long long int value;
cin>>value;
v.push_back(value);
minimum1=min(minimum1,value);
}
for(int i=0;i<n-1;i++){
long long int value;
cin>>value;
u.insert(value);
minimum2=min(minimum2,value);
}
long long int check=minimum2-minimum1;
for(int i=0;i<n;i++){
if(u.find(v[i]+check)!=u.end())
same++;
else {
not_same++;
}
}
if(same>=2)
cout<<check<<endl;
else if(not_same>=2){
for(int i=0;i<n;i++){
if(minimum1!=v[i]){
minimum=min(minimum,v[i]);
}
}
cout<<minimum2-minimum<<endl;
}
else
{
if((minimum2-max(v[0],v[1])>=0))
cout<<minimum2-max(v[0],v[1]);
else
cout<<check;
cout<<endl;
}
}
}
Learning course: Jump from 2* to 3*
Problem Link: Practice Problem in - CodeChef