#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> values(n);
for (int i = 0; i < n; i++)
{
cin >> values[i];
}
sort(values.begin(), values.end());
for (int i = 0, j = n - 1; i < j;)
{
if (values[i] + values[j] == m)
{
cout << values[i] << " " << values[j] << endl;
return 0;
}
else if (values[i] + values[j] > m)
j--;
else
i++;
}
cout << "No Solution" << endl;
}
PAT (Advanced) 1048. Find Coins (25)
最新推荐文章于 2021-02-09 21:24:45 发布