#include <iostream>
#include <algorithm>
using namespace std;
int r[1005];
int main()
{
    int n,t;
    cin >> n >> t;
    for (int i = 1;i <= n;i++)
    {
        cin >> r[i];
    }
    while (t--)
    {
        int maxn = *max_element(r + 1,r + n + 1);
        int maxn_l = 0;
        for (int i = 1;i <= n;i++)
        {
            if (maxn == r[i])
            {
                maxn_l = i;
                break;
            }
        }
        cout << maxn << endl;
        for (int i = 1;i <= n;i++)
        {
            if (maxn_l == i)
            {
                continue;
            }
            r[i] += r[maxn_l] / (n - 1);
            r[maxn_l] -= r[maxn_l] / (n - 1);
        }
        if (r[maxn_l])
        {
            int tsg = r[maxn_l];
            for (int i = 1;i <= tsg;i++)
            {
                if (i == maxn_l)
                {
                    tsg++;
                    continue;
                }
                r[i]++;
            }
        }
    }
    return 0;
}

测试点信息源代码
测试点信息:

1. 3ms/680.00KB WA
2. 0ms/0B RE
3. 3ms/852.00KB WA
4. 4ms/692.00KB WA
5. 4ms/680.00KB WA
6. 4ms/684.00KB WA
7. 4ms/672.00KB WA
8. 19ms/800.00KB WA
9. 0ms/0B RE
10. 8ms/684.00KB WA