洛谷P1271 【深基9.例1】选举学生会进阶解法

#include<iostream>
#include<algorithm>
const int MAX = 2000000;

using namespace std;
int n, m,ticket[MAX];

int main()
{
	cin >> n >> m;
	for (int i = 0; i < m; i++)
		cin >> ticket[i];
	sort(ticket, ticket + m);
	for(int i=0;i<m;i++)
		cout<<ticket[i]<<' ';
	return 0;
}