面试金典之（一）找出和为SUM的递增数组array中的两个数使之乘积最小

class Solution {
public:
	vector<int> FindNumbersWithSum(vector<int> array, int sum) 
	{
		vector<int>res;
		int temp = 0;
		int i = 0, j = array.size() - 1;
		while (i < j&&temp!=sum)
		{
			temp = array[i] + array[j];
			if (temp>sum)j--;
			else if (temp == sum)
			{
				res.push_back(array[i]);
				res.push_back(array[j]);
				break;
			}
				else i++;
		}
		return res;
	}
};