排序,然后扫描一遍就可以。
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
using namespace std;
vector<int> v;
int main()
{
int n, sum, x;
scanf("%d %d", &n, &sum);
for(int i=0; i<n ;i++)
{
scanf("%d", &x);
v.push_back(x);
}
sort(v.begin(), v.end());
int start = 0, end = v.size()-1;
while(start < end)
{
int tmp = v[start] + v[end];
if(tmp == sum) break;
else if(tmp > sum) end -- ;
else start ++ ;
}
if(start >= end)
{
printf("No Solution\n");
}
else
{
printf("%d %d\n", v[start], v[end]);
}
return 0;
}