Thursday, 6 April 2017

Geeksforgeeks Solution For " Merge 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 :- Merge Two Sorted Arrays

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,m,i,j,sum,res=0;
        cin>>n>>m;
        j=n+m;
        vector<int > arr(j);
        
        for(i=0;i<n;i++)
        cin>>arr[i];
        
        for(i=n;i<j;i++)
        cin>>arr[i];
        
        sort(arr.begin(),arr.end());
        
        for(i=j-1;i>=0;i--)
        cout<<arr[i]<<" ";
        cout<<endl;

    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Merge Two Sorted Arrays "

No comments:
Write comments

Recommended Posts × +