跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0778. April Fools' Problem (easy)

  • ID: 784
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

April Fools' Problem (easy)

题目描述

M. April Fools' Problem (easy)
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The marmots have prepared a very easy problem for this year's HC2 — this one. It involves numbers n, k and a sequence of n positive integers a1,a2,...,an. 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 a1,...,an (1≤ai≤104).

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 205 题。保留原作者与原赛事署名。