解析
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<unordered_set>
using namespace std;
bool func(const vector<int>& data,int M) {
for (int i = 0; i <data.size()-1; i++) {
if (data[i] + data[data.size()- 1] < M)
continue;
if (binary_search(data.begin() + i + 1, data.end(), M-data[i])) {
printf("%d %d", data[i],M-data[i]);
return true;
}
}
return false;
}
int main()
{
int N, M;
scanf("%d %d", &N, &M);
vector<int> data(N);
for (int i = 0; i < N; i++)
scanf("%d", &data[i]);
sort(data.begin(), data.end());
if (func(data,M)== false)
printf("No Solution");
}