Codeforces Round #525 (Div. 2) B. Ehab and subtraction(思维)

#include <bits/stdc++.h>
#define maxn 100005
#define ll long long
using namespace std;
int pre[maxn];
int n,m;

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d",&pre[i]);
	}
	sort(pre + 1, pre + 1 + n);
	int ans = 0;
	vector<int> v;
	for(int i=1;i<=n;i++){
		if(i > n) v.push_back(0);
		else{
			if(pre[i] - ans == 0)continue;
			v.push_back(pre[i] - ans);
			ans += pre[i] - ans;
		}
	}
	for(int i=0;i<m;i++){
		if(i>=v.size()) puts("0");
		else
		  cout<<v[i]<<endl;
	}
	return 0;
}