Helvetic Coding Contest 2017 online mirror (teams allowed, unrated) M

Description

The marmots have prepared a very easy problem for this year's HC² – this one. It involves numbers n, k and a sequence of n positive integersa₁, a₂, ..., 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!

Input

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₁, ..., a_n (1 ≤ a_i≤ 10⁴).

Output

Output one number.

Examples

input

8 5
1 1 1 1 1 1 1 1

output

5

input

10 3
16 8 2 4 512 256 32 128 64 1

output

7

input

5 1
20 10 50 30 46

output

10

input

6 6
6 6 6 6 6 6

output

36

input

1 1
100

output

100
题意：额。。。就是选k个数字（从小到大加起来啦）
解法：同上

#include<bits/stdc++.h>
using namespace std;
long long sum;
int t;
int k,n;
int x[12345];
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i];
    }
    sort(x+1,x+1+n);
    for(int i=1;i<=k;i++)
    {
        sum+=x[i];
    }
    cout<<sum<<endl;
    return 0;
}