2 SUM Maximum or Minimun Subarray program / implementation in C++ / C

#include<bits/stdc++.h>
using namespace std;

main()
{
int a[]={1,4,5,6,7,9,9,10};
int n=sizeof(a)/sizeof(a[0]);
sort(a,a+n);
int j=n-1,i=0,num;
cout<<"Enter Number To find Sum:";
cin>>num;
for(int k=0;k<n;k++)
{
if(a[i]+a[j]>num)
j--;
else
if(a[i]+a[j]<num)
i++;
else
{
cout<<"Founded:"<<num<<"At Index:"<<"["<<i<<","<<j<<"]";
break;
}
}
}

Insertion In Array by Pointers C++ Program Exampe

#include<iostream>
using namespace std;
#include<conio.h>
 main()
{
int num[50],n, num1, i, pos,*p;
cout<<"Enter Array Size : ";
cin>>n;
cout<<"Enter Numbers : ";
for(i=0; i<n; i++)
cin>>num[i];
p=num;
cout<<"Enter Number to be inserted : ";
cin>>num1;
cout<<"Enter position :";
cin>>pos;
for(i=n; i>pos; i--)
{
*(p+i)=*(p+i-1);
}
*(p+pos)=num1;
for(i=0; i<n+1; i++)
{
cout<<*(p+i)<<" ";
}
getch();
}