1 #include<stdio.h>
2 #include<stdlib.h>
3 int cmp(const void *a,const void *b)
4 {
5 return *(int *)a - *(int *)b;
6 }
7 int main(int argc, char *argv[])
8 {
9 int n,a[100005],i,m;
10 int left,right;
11
12 scanf("%d",&n);
13 for(i=0;i<n;i++)
14 scanf("%d",&a[i]);
15 scanf("%d",&m);
16 qsort(a,n,sizeof(int),cmp);
17 left=0;
18 right=n-1;
19 while(left<right)
20 {
21 if(a[left]+a[right]<m) left++;
22 else if(a[left]+a[right]>m) right--;
23 else break;
24 }
25 if(left<right) printf("%d %d\n",a[left],a[right]);
26 else printf("No\n");
27 return 0;
28 }