题库练习 Ehab and subtraction
← 上一题 下一题 →

A12176 | Ehab and subtraction

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You're given an array $a$ . You should repeat the following operation $k$ times: find the minimum non-zero element in the array, print it, and then subtract it from all the non-zero elements of the array. If all the elements are 0s, just print 0.

输入格式

The first line contains integers $n$ and $k$ $(1 \le n,k \le 10^5)$ , the length of the array and the number of operations you should perform.

The second line contains $n$ space-separated integers $a_1, a_2, \ldots, a_n$ $(1 \le a_i \le 10^9)$ , the elements of the array.

输出格式

Print the minimum non-zero element before each operation in a new line.

输入输出样例

输入 #1
3 5
1 2 3
输出 #1
1
1
1
0
0
输入 #2
4 2
10 3 5 3
输出 #2
3
2
C++ 编辑器
输入
输出