Preparing NOJ

Sum is K

1000ms 65536K

Description:

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.

Input:

First line: two positive integers N (N <= 1000) and K (K <= 1000000).
Second line: N positive integers (<= 1000000).

Output:

Two integers A and B.

Sample Input:

5 12
2 4 7 3 9

Sample Output:

3 9

Info

NOIOPEN

Provider NOIOPEN

Origin 简单英文题

Code NOIOPJENGLISH15

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 08/15/2021 18:56:22

Related

Nothing Yet