CF802M.April Fools' Problem (easy)

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The marmots have prepared a very easy problem for this year's HC $^{2}$ – this one. It involves numbers $n$ , $k$ and a sequence of $n$ positive integers $a_{1},a_{2},...,a_{n}$ . They also came up with a beautiful and riveting story for the problem statement. It explains what the input means, what the program should output, and it also reads like a good criminal.

However I, Heidi, will have none of that. As my joke for today, I am removing the story from the statement and replacing it with these two unhelpful paragraphs. Now solve the problem, fools!

输入格式

The first line of the input contains two space-separated integers $n$ and $k$ ( $1<=k<=n<=2200$ ). The second line contains $n$ space-separated integers $a_{1},...,a_{n}$ ( $1<=a_{i}<=10^{4}$ ).

输出格式

Output one number.

输入输出样例

输入#1
```
8 5
1 1 1 1 1 1 1 1
```
输出#1
```
5
```
输入#2
```
10 3
16 8 2 4 512 256 32 128 64 1
```
输出#2
```
7
```
输入#3
```
5 1
20 10 50 30 46
```
输出#3
```
10
```
输入#4
```
6 6
6 6 6 6 6 6
```
输出#4
```
36
```
输入#5
```
1 1
100
```
输出#5
```
100
```

首页