Tikut

input/code.cpp: In function 'void solve()':
input/code.cpp:69:30: warning: comparison of integer expressions of different signedness: 'std::set<std::array<int, 3> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   69 |             while (cur.size()>k-i) {
      |                    ~~~~~~~~~~^~~~
input/code.cpp:68:17: warning: unused variable 'j' [-Wunused-variable]
   68 |             int j = 0;
      |                 ^

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<class T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

// const ll M = 998244353;
const ll M = 1e9 + 7;
// ll M;


#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define PI 3.141592653589793238462643383279502884L

const ll INFL = 1e18;
const int INF = 1e9;
const ll maxN = 5e5+1;


bool comp(array<int, 3> l, array<int, 3> r) {
    if (l[0]==r[0]) {
        return l[2]<r[2];
    } return l[0]>r[0];

}
void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), cnt(n, 1);
    for (auto &u: a) cin >> u;
    vector<array<int, 3>> maxs, mins;
    for (int i=0; i<n; i++) {
        for (int j=1; j<=m+1; j++) {
            maxs.push_back({(a[i]+j-1)/j, i, j});
            if (j!=1) mins.push_back({a[i]/j, i, j});
        }
    }
    sort(all(maxs), comp);
    sort(all(mins), comp);
    maxs.resize(m+1);
    mins.resize(m+1);
    cout << '\n';
    for (int k=1; k<=m; k++) {
        vector<int> cnt(n, 1);
        int best = INF;
        int p_mn = *min_element(all(a));
        set<array<int, 3>> cur;
        for (int i=0; i<k; i++) {
            cur.insert(mins[i]);
        }
        for (int i=0; i<=k; i++) {
            int j = 0;
            while (cur.size()>k-i) {
                cur.erase(cur.begin());
            }
            int mn = p_mn;
            if (cur.size()) mn =min(mn, (*cur.begin())[0]);
            best = min(best, maxs[i][0]-mn);

            int idx= maxs[i][1];
            cnt[idx]++;
            cur.erase({a[idx]/cnt[idx], idx, cnt[idx]});
            p_mn = min(p_mn, a[idx]/cnt[idx]);
        }
        cout << best << '\n';

    }

    // for (int i=0; i<n; i++) {
    //
    // }
    // for (int i=0; i<m; i++) {
    //     cout << '\n';
    //     int mx = 0, mn = INF;
    //     for (int i=0; i<n; i++) {
    //         mx = max(cd(i), mx);
    //         mn = min(d(i), mn);
    //     }
    //     cout << mx-mn << '\n';
    // }
    
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cout << setprecision(12);


    int tc = 1;
    // cin >>tc;
    while (tc--) solve();

}

Test 1

Group: 1, 3, 4, 5, 6

Verdict: ACCEPTED

Test 2

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 3

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 4

Group: 1, 4, 5, 6

Verdict: ACCEPTED

Test 5

Group: 2, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 5, 6

Verdict: ACCEPTED

Test 7

Group: 3, 5, 6

Verdict: ACCEPTED

Test 8

Group: 3, 5, 6

Verdict: ACCEPTED

Test 9

Group: 3, 5, 6

Verdict: ACCEPTED

Test 10

Group: 3, 5, 6

Verdict: ACCEPTED

Test 11

Group: 3, 5, 6

Verdict: ACCEPTED

Test 12

Group: 4, 5, 6

Verdict: ACCEPTED

Test 13

Group: 4, 5, 6

Verdict: ACCEPTED

Test 14

Group: 4, 5, 6

Verdict: ACCEPTED

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

Test 16

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 18

Group: 5, 6

Verdict: ACCEPTED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 6

Verdict: RUNTIME ERROR

Test 21

Group: 6

Verdict: RUNTIME ERROR

Test 22

Group: 6

Verdict: RUNTIME ERROR