#include<stdio.h>
int main(){
int i, n, m, temp, ascall[1100]={0};
scanf("%d%d",&n,&m);
for(i=0;i<n;i++){
scanf("%d",&temp);
ascall[temp]++;
}
int flag=0;
for(i=1;i<m/2;i++){
if(ascall[i]!=0&&ascall[m-i]!=0){printf("%d %d\n",i,m-i);flag=1;break;}
}
if(m%2==1 &&flag==0){if(ascall[m/2]!=0&&ascall[m/2+1]!=0){printf("%d %d\n",m/2,m/2+1);flag=1;} }
if(m%2==0 &&flag==0){if(ascall[m/2]>1){printf("%d %d\n",m/2,m/2); flag=1;} }
if(flag==0 )printf("No Solution\n");
return 0;
}
PAT-A1048
最新推荐文章于 2019-02-26 13:16:54 发布