Enter an array and a number that have been sorted in ascending order, and find two numbers in the array so that they are exactly the number entered.

Title: Enter an array that has been sorted in ascending order and a number,
//Find two numbers in the array so that they are exactly the number entered.
#include <iostream>
using namespace std;

void Fun (int num[],int n,int sum)
{
	//define two subscript
	int i = 0; 
    int j = n-1;
    int tmp;
    bool solve = false;
    while (I < j) {
        tmp = Num[i] + num[j];
        if (tmp = = SUM) {
            solve = true;
            cout << Num[i] << "<< num[j" << Endl;
            break;    
        }    
        else if (tmp < sum) {
            i + +;    
        }
        else{
            J--;    
        }
    }    
    if (!solve) {
        cout << "There is not." << Endl;    
    }
}
int main ()
{
    int n = 6; 
	int num[6] = {1,2,4,7,11,15};
    int sum;
    scanf ("%d", &sum);
    Fun (num,n,sum);
    System ("pause"); 
}