OpenJudge - 16:Maximum Sum Not Exceeding K
描述
Given N numbers, find two different numbers from them such that the sum of the two numbers is maximum but not exceeding K.
输入
First line: two positive integers N (N <= 1000) and K (K <= 1000000).
Second line: N positive integers (<= 1000000).
输出
Two integers.
翻译:给出N个数,找到两个不同的数,使得这两个数的和最大并且不超过K。
输入:
第一行:两个正整数N和K
第二行:N个正整数。
输出:
两个数。