1048. 数字加密

 

#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;
int a[100010];

int bin(int left,int right,int key){
	int mid;
	while(left<=right){
		mid = (left+right)/2;
		if(a[mid]==key) return mid;
		else if(a[mid]>key) right = mid-1;
		else left = mid+1;
	}
	return -1;
}
int main(){
	int i,n,m;
	scanf("%d%d",&n,&m);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	sort(a,a+n);
	for(i=0;i<n;i++){
		int pos = bin(0,n-1,m-a[i]);
		if(pos!=-1&&i!=pos){
			printf("%d %d\n",a[i],a[pos]);
			break;
		}
	}
	if(i==n) printf("No Solution\n");
	return 0;
}