#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main(){
freopen("1.in", "r", stdin);
int n, m;
scanf("%d%d", &n, &m);
int *a = new int[n];
int i, j, flag = 0;
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
i = 0;
j = n - 1;
int first, last;
while (i < j){
if (a[i] + a[j] < m)
i++;
else if (a[i] + a[j] > m)
j--;
else if (a[i] + a[j] == m){
flag = 1;
first = a[i];
last = a[j];
break;
}
}
if (flag)
printf("%d %d\n", first, last);
else printf("No Solution\n");
return 0;
}
pat 1048
最新推荐文章于 2023-01-15 21:14:21 发布