C. Less or Equal

Codeforces

IDCF977C

Time2000ms

Memory256MB

Difficulty—

sortings

You are given a sequence of integers of length $n$ and integer number $k$. You should print **any integer** number $x$ in the range of $[1; 10^9]$ (i.e. $1 \le x \le 10^9$) such that exactly $k$ elements of given sequence are less than or equal to $x$. Note that the sequence can contain equal elements. If there is no such $x$, print "_\-1_" (without quotes). ## Input The first line of the input contains integer numbers $n$ and $k$ ($1 \le n \le 2 \cdot 10^5$, $0 \le k \le n$). The second line of the input contains $n$ integer numbers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$) — the sequence itself. ## Output Print **any integer** number $x$ from range $[1; 10^9]$ such that exactly $k$ elements of given sequence is less or equal to $x$. If there is no such $x$, print "_\-1_" (without quotes). [samples] ## Note In the first example $5$ is also a valid answer because the elements with indices $[1, 3, 4, 6]$ is less than or equal to $5$ and obviously less than or equal to $6$. In the second example you cannot choose any number that only $2$ elements of the given sequence will be less than or equal to this number because $3$ elements of the given sequence will be also less than or equal to this number.

Samples

Input #1

7 4
3 7 5 1 10 3 20

Output #1

Input #2

7 2
3 7 5 1 10 3 20

Output #2

\-1

API Response (JSON)

{
  "problem": {
    "name": "C. Less or Equal",
    "description": {
      "content": "You are given a sequence of integers of length $n$ and integer number $k$. You should print **any integer** number $x$ in the range of $[1; 10^9]$ (i.e. $1 \\le x \\le 10^9$) such that exactly $k$ eleme",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF977C"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence of integers of length $n$ and integer number $k$. You should print **any integer** number $x$ in the range of $[1; 10^9]$ (i.e. $1 \\le x \\le 10^9$) such that exactly $k$ eleme...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments