剑指offer42: 和为S的两个数字
class Solution {
public:
    vector<int> FindNumbersWithSum(vector<int> array,int sum) {
        int flag=INT_MAX;
        vector<int> b(2,-1);
        for(int i=0;i<array.size();i++)
            for(int j=i+1;j<array.size();j++)
            {
                if(array[i]+array[j]==sum)
                {
                    if(array[i]*array[j]<flag)
                    {
                        b[0]=array[i];
                        b[1]=array[j];
                        flag=b[0]*b[1];
                    }
                    
                }
            }
        if(b[0]+b[1]!=-2)
            return b;
        else
            return {};
        
    }
};