AtCoder Beginner Contest 171
翻译中…
Problem Statement
翻译中…
A shop sells $N$ kinds of fruits, Fruit $1, \ldots, N$, at prices of $p_1, \ldots, p_N$ yen per item, respectively. (Yen is the currency of Japan.)
翻译中…
Here, we will choose $K$ kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.
翻译中…
Constraints
翻译中…
$1 \leq K \leq N \leq 1000$$1 \leq p_i \leq 1000$- All values in input are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N K
p_1 p_2 \ldots p_N翻译中…
Output
翻译中…
Print an integer representing the minimum possible total price of fruits.
翻译中…
样例
Input #1
5 3
50 100 80 120 80
Output #1
210
This shop sells Fruit $1$, $2$, $3$, $4$, and $5$ for $50$ yen, $100$ yen, $80$ yen, $120$ yen, and $80$ yen, respectively.
The minimum total price for three kinds of fruits is $50 + 80 + 80 = 210$ yen when choosing Fruit $1$, $3$, and $5$.
Input #2
1 1
1000
Output #2
1000
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。