AcWing 1532. 找硬币
原题链接
简单
作者:
CarpeDime
,
2021-01-19 23:28:04
,
所有人可见
,
阅读 337
C++ 代码
#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100010;
int n, m;
int coin[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++ i) {
scanf("%d", &coin[i]);
}
sort(coin, coin + n);
for (int i = 0, j = n - 1; i < j; i ++ ){
while (i < j && coin[i] + coin[j] > m) j -- ;
if (i < j && coin[i] + coin[j] == m){
printf("%d %d\n", coin[i], coin[j]);
return 0;
}
}
puts("No Solution");
return 0;
}