Mix Juice

AtCoder

IDabc171_b

Time2000ms

Memory256MB

Difficulty—

A shop sells $N$ kinds of fruits, Fruit $1, \ldots, N$, at prices of $p_1, \ldots, p_N$ yen per item, respectively. (Yen is the currency of Japan.) Here, we will choose $K$ kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits. ## Constraints * $1 \leq K \leq N \leq 1000$ * $1 \leq p_i \leq 1000$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ $p_1$ $p_2$ $\ldots$ $p_N$ [samples]

Samples

Input #1

5 3
50 100 80 120 80

Output #1

210

This shop sells Fruit $1$, $2$, $3$, $4$, and $5$ for $50$ yen, $100$ yen, $80$ yen, $120$ yen, and $80$ yen, respectively.
The minimum total price for three kinds of fruits is $50 + 80 + 80 = 210$ yen when choosing Fruit $1$, $3$, and $5$.

Input #2

1 1
1000

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Mix Juice",
    "description": {
      "content": "A shop sells $N$ kinds of fruits, Fruit $1, \\ldots, N$, at prices of $p_1, \\ldots, p_N$ yen per item, respectively. (Yen is the currency of Japan.) Here, we will choose $K$ kinds of fruits and buy one",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc171_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "A shop sells $N$ kinds of fruits, Fruit $1, \\ldots, N$, at prices of $p_1, \\ldots, p_N$ yen per item, respectively. (Yen is the currency of Japan.)\nHere, we will choose $K$ kinds of fruits and buy one...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments