计数排序 洛谷P1271 【深基9.例1】选举学生会

#include<iostream>
#include<cmath>
using namespace std;
long long ren[1010];
long long piao[2000010];
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> piao[i];
        ren[piao[i]]++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (ren[i] != 0)
        {
            for (int j = 1; j <= ren[i]; j++)
                cout << i<<" ";
        }
    }
    return 0;
}