2 solutions

  • 0
  • 1
    @ 2026-3-26 11:31:46

    #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    } #include <bits/stdc++.h> #define int long long using namespace std;

    signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; vector a(n); map<int, int> f; for (int i = 0; i < n; i++) { cin >> a[i]; f[a[i]]++; } int c = 0; while (true) { int l = f.begin()->first; int r = f.rbegin()->first; if (r <= l + 1 + k) break; int fl = f[l]; int fr = f[r]; int b = min(fl, fr); c += b * k;

            f[l] -= b;
        if (f[l] == 0) 
            f.erase(l);
        f[l + 1] += b;

        f[r] -= b;
        if (f[r] == 0) 
            f.erase(r);
        f[r - 1] += b;
    }
    int s = 0;
    for (auto &p : f) {
        int v = p.first;
        int x = p.second;
        s += x * (v * (v + 1) / 2);
    }
    cout << c + s << "\n";
}
return 0;

    }

    • 1
      @ 2025-8-14 14:05:20 
      #include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n, k;
        cin >> n >> k;
        vector<int> a(n);
        map<int, int> f;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            f[a[i]]++;
        }
        int c = 0;
        while (true) {
            int l = f.begin()->first;
            int r = f.rbegin()->first;
            if (r <= l + 1 + k) 
                break;
            int fl = f[l];
            int fr = f[r];
            int b = min(fl, fr);
            c += b * k;

            f[l] -= b;
            if (f[l] == 0) 
                f.erase(l);
            f[l + 1] += b;

            f[r] -= b;
            if (f[r] == 0) 
                f.erase(r);
            f[r - 1] += b;
        }
        int s = 0;
        for (auto &p : f) {
            int v = p.first;
            int x = p.second;
            s += x * (v * (v + 1) / 2);
        }
        cout << c + s << "\n";
    }
    return 0;
}
      • 1

      堵车

      Information

      ID
      1549
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      8
      Tags
      # Submissions
      83
      Accepted
      10
      Uploaded By
      1. About
      2. Contact Us
      3. Privacy
      4. Terms of Service
      5. Copyright Complaint
      6. Language
      7. Legacy mode
      8. Theme
      3. Worker 0, 445ms
      4. Powered by Hydro v4.19.1 Community