先排序,再用双指针探测
//
// main.cpp
// PATA1048
//
// Created by Phoenix on 2018/2/13.
// Copyright © 2018年 Phoenix. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int num[maxn];
int main(int argc, const char * argv[]) {
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
sort(num, num + n);
int i = 0, j = n - 1;
while(i < j) {
if(num[i] + num[j] == m) break;
else if(num[i] + num[j] > m) j--;
else i++;
}
if(i < j) printf("%d %d\n", num[i], num[j]);
else printf("No Solution\n");
return 0;
}