Geeksforgeeks Solution For " Sum of Middle Elements of two sorted arrays "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Sum of Middle Elements of two sorted arrays

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int t,n,val;
cin>>t;
while(t--){

cin>>n;
int a[n],b[n];
vector<int>c(2*n);
for(int i=0;i<n;i++){
cin>>a[i];
}

for(int i=0;i<n;i++){
cin>>b[i];
}
merge(a,a+n,b,b+n,c.begin());
int s=c.size();
cout<<(c[(s/2)-1]+c[s/2])<<endl;

}
}

Output:-