marge and sort and search

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,k;
    cout<<"Enter Arry one size\n";
    cin>>n;
    int a[n],i;
    cout<<"Enter Arry one value\n";
    for(i=0; i<n; i++)
    {
        cin>>a[i];

    }
    cout<<"Enter Arry Two size :\n";
    cin>>p;
    int b[p],j,m,r;
    cout<<"Enter Arry Two value :\n";
    for(j=0; j<p; j++)
    {
        cin>>b[j];
    }
    int t=n+p;
    int final[t];
    for(i=0;i<n;i++)
    {
        final[i]=a[i];
    }
    k=i;
    for(j=0;j<p;j++)
    {
        final[k]=b[j];
        k++;
    }
    cout<<"Final value :\n";

    for(i=1; i<t; i++)
    {
        m=final[i];
        r=i-1;
        while(r>=0&&final[r]<m)
        {
            final[r+1]=final[r];
            r--;
        }
        final[r+1]=m;
    }
    for(i=0; i<t; i++)
    {
        cout<<final[i]<<"   ";
    }
    cout<<"\n";
    int high=t-1;

    int low=0,s,res=0;
    cout<<"Enter search value\n ";
    cin>>s;

    while(low<=high)
    {
        int mid = (low + high) / 2;

        if (final[mid] == s)
        {

            int q=count(final, final + t, s);
            cout<<s<<" is found "<<q<<" times in the array";
            return 0;

        }

        if (final[mid]<s)
        {
            high = mid - 1;
        }
        else
        {
            low= mid + 1;
        }
        final[mid]=0;
        sort(final,final+t,greater<int>());
    }

    cout<<"\nNot Found\n";

}