Snake Toy

AtCoder

IDabc067_b

Time2000ms

Memory256MB

Difficulty—

Snuke has $N$ sticks. The length of the $i$\-th stick is $l_i$. Snuke is making a snake toy by joining $K$ of the sticks together. The length of the toy is represented by the sum of the individual sticks that compose it. Find the maximum possible length of the toy. ## Constraints * $1 \leq K \leq N \leq 50$ * $1 \leq l_i \leq 50$ * $l_i$ is an integer. ## Input Input is given from Standard Input in the following format: $N$ $K$ $l_1$ $l_2$ $l_3$ $...$ $l_{N}$ [samples]

Samples

Input #1

5 3
1 2 3 4 5

Output #1

12

You can make a toy of length $12$ by joining the sticks of lengths $3$, $4$ and $5$, which is the maximum possible length.

Input #2

15 14
50 26 27 21 41 7 42 35 7 5 5 36 39 1 45

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Snake Toy",
    "description": {
      "content": "Snuke has $N$ sticks. The length of the $i$\\-th stick is $l_i$. Snuke is making a snake toy by joining $K$ of the sticks together. The length of the toy is represented by the sum of the individual sti",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc067_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke has $N$ sticks. The length of the $i$\\-th stick is $l_i$.\nSnuke is making a snake toy by joining $K$ of the sticks together.\nThe length of the toy is represented by the sum of the individual sti...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments