## Problem C: Fire

Firebending is an intense and aggressive bending art which uses concentrated barrages of fire, controlled by one's inner chi to overwhelm opponents. According to uncle Iroh, fire is the element of power. Of course, with great power comes great responsibility. Aang has just gained a new friend and firebending master, Zuko, to teach him the ways of the dragons.

In the past, Aang has attempted firebending on his own. However, due to a serious incident where he accidentally burned Katara, he's learned that fire is not to be toyed with. Ever since, Aang has been scared of firebending. Zuko realized what he must do – to teach Aang control. Only when Aang feels completely in control can his true training begin.

As an exercise, Zuko places N (1 ≤ N ≤ 104) leaves in front of Aang. He simultaneously sets all of the leaves on fire. Aang's job must be to control the burning rate of the leaves. The leaves all start burning from the inside. The i-th leaf (1 ≤ iN) will spend si (1 ≤ si ≤ 106) seconds burning before it is completely gone.

Aang is very new at this, and can only handle a certain amount of leaves at once. Throughout the entire exercise, he is currently only able to focus his chi onto at most K (1 ≤ KN) leaves. When Aang focuses on a leaf, the time it takes for the leaf to completely burn out will double. Aang will pick the K leaves at the beginning of the exercise and cannot switch after he's made the decision. Can you help Aang determine the time it takes for the first leaf to burn out?

### Input Format

Line 1: Two integers N and K, respectively representing the number of total leaves and the number of leaves Aang can focus on controlling.
Line 2: N space-separated integers s1, s2, … sN, respresenting the time it takes for each leaf to burn out without Aang's interference.

### Output Format

A single integer representing the number of seconds until the earliest leaf to burn out has fully burned out.

### Sample Input 1

```10 3
8 7 3 8 5 5 6 3 9 3
```

```5
```

```1 1
3
```

### Sample Output 2

```6
```

Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M
Author: frenzybenzy

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

• (0/0)
could anyone tell me why im getting the last 2 test cases wrong?

• (0/0)
You are not using some of your variables.

• (0/0)
How do you know witch leaves Aang picks?

What are you supposed to find?

• (3/0)
You choose the leaves that Aang picks, and you find the maximum amount of time before the first leaf runs out of time.

In the sample input Aang gets 3 leaves in which he can double the durability

The most logical decisions is to pick:

8 7 3 8 5 5 6 3 9 3

That leaves the 2 fives as the fastest burning leaves.

so you output 5 because the first leaves burn at 5 seconds.