#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<set>
using namespace std;
vector<int> coins;
int main(){
int n, m;
cin>>n>>m;
for(int i = 0; i < n; i++){
int temp;
scanf("%d",&temp);
coins.push_back(temp);
}
sort(coins.begin(),coins.end());
int low = 0;
int high = coins.size() - 1;
while(low < high){
int sum = coins[low] + coins[high];
if(sum == m){
printf("%d %d",coins[low],coins[high]);
return 0;
}
else if(sum > m){
high--;
}
else{
low++;
}
}
if(low >= high){
printf("No Solution");
}
return 0;
}
1048. Find Coins (25)
最新推荐文章于 2020-06-18 21:48:50 发布