题解ACM模式| 和为S的两个数字

#include<iostream>
#include<vector>
using namespace std;

vector<int> findSum(vector<int> array, int sum) {
	int left = 0, right = array.size() - 1;
	while (left < right) {
		int tmp = array[left] + array[right];
		if (tmp == sum) {
			return { array[left], array[right] };
		}
		else if (tmp < sum) {
			left++;
		}
		else {
			right--;
		}
	}
	return {};
}

int main() {
	vector<int> array, res;
	int num;
	while (cin.peek() != '\n') {
		cin >> num;
		array.push_back(num);  // 直接 push_back 添加元素
	}
	int sum = 0;
	cin >> sum;
	res = findSum(array, sum);
	for (auto r : res) {
		cout << r << endl;
	}
	return 0;
}