http://noi.openjudge.cn/english/15/
描述
Given a sequence of N numbers. Find different numbers A and B in the sequence so that the sum of A and B equals to K.
输入
First line: two positive integers N (N <= 1000) and K (K <= 1000000).
Second line: N positive integers (<= 1000000).
输出
Two integers A and B.
和为K
描述:
给定N个数字的序列。在序列中找不同的数字A,B使得A,B之和为K。
输入:
第一行:两个正整数N(N <= 1000) 和 K(K < = 1000000)
第二行:N个正整数(<= 1000000)。
输出:
两个整数A和B