|| ||Code Submission Evaluation System
CSES Problem Set
Sum of Two Values
Task | Statistics
CSES - Sum of Two ValuesCSES - Sum of Two Values
|Time limit:||1.00 s
||Memory limit:||512 MB|
You are given an array of $n$ integers, and your task is to find two values (at distinct positions) whose sum is $x$.
The first input line has two integers $n$ and $x$: the array size and the target sum.
The second line has $n$ integers $a_1,a_2,\dots,a_n$: the array values.
Print two integers: the positions of the values. If there are several solutions, you may print any of them. If there are no solutions, print
- $1 \le n \le 2 \cdot 10^5$
- $1 \le x,a_i \le 10^9$
2 7 5 1