paste bin

#include <cstdio>
#include <algorithm>
using std::sort;
using std::binary_search;

int main(void)
{
    int *a,i,N,K;
    scanf("%d",&N);
    a=new int [N];
    for (i=0;i<N;i++)
        scanf("%d",a+i);
    sort(a,a+N);
    scanf("%d",&K);

    for(i=0;i<N-1;i++)
    {
        if(binary_search(a+i+1,a+N,K-a[i]))
        {
            printf("%d %d\n",a[i],K-a[i]);
            break;
        }
    }
    if(i==N-1)
        printf("No\n");
    delete [] a;
    return 0;

}