剑指offer 和为S的两个数字

class Solution {
    public: vector < int > FindNumbersWithSum(vector < int > array, int sum) {
        int pivot;
        int pivotindex = 0;
        int length = array.size();
        vector < int > result;
        vector < vector < int > >temp;
        if (sum == 0) {
            pivot = 0;
        } else {
            pivot = sum / 2;
        } //找到pivot的位置        
        while (pivotindex < length) {
            if (array[pivotindex] > pivot) {
                pivotindex--;
                break;
            }
            pivotindex++;
        } //将pivot和pivot右边的数字进行组合        
        for (int i = pivotindex; i >= 0; i--) {
            for (int j = pivotindex + 1; j < length; j++) {
                if ((array[i] + array[j]) == sum) {
                    vector < int > candidate;
                    candidate.push_back(array[i]);
                    candidate.push_back(array[j]);
                    temp.push_back(candidate);
                }
                if ((array[i] + array[j]) > sum) {
                    break;
                }
            }
        } //如果有多对数字的和等于S，就选乘积最小的        
        if (temp.size() >= 2) {
            int min = temp[0][0] * temp[0][1];
            int minindex;
            for (int i = 0; i < temp.size(); i++) {
                int num1 = temp[i][0];
                int num2 = temp[i][1];
                if (num1 * num2 < min) {
                    min = num1 * num2;
                    minindex = i;
                }
            }
            result = temp[minindex];
        } else if (temp.size() == 0) {
            return result;
        } else {
            result = temp[0];
        }
        return result;
    }
};