CF1394A Boboniu Chats with Du

传送门

注：把大于m的ai自身看作没有价值，即价值为0

补：图中方块长度为4是错的，应该是3.即20覆盖0 0 0    18覆盖 1 2 2  17覆盖2 4 5

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <cstring>
#include <functional>
#include <map>
#define LL long long
#define lson(rt) (rt << 1)
#define rson(rt) (rt << 1 | 1)
using namespace std;

const int N = 1e6 + 10;

void fun()
{

    int sum = 0;
    int x;
    while(cin >> x) sum += x;
    cout << "sum =  " << sum << endl;
}

void solve ()
{
    //fun();
    int n, d, m;
    scanf("%d%d%d", &n, &d, &m);
    d++;
    vector<LL > tmp, v, add;
    for(int i = 0; i < n; ++i) {
        long long x;
        scanf("%lld", &x);
        tmp.push_back(x);
    }
    sort(tmp.begin(), tmp.end());
    for(auto x : tmp) cout << x << " ";
    cout << endl;
    long long sum = tmp[n - 1];
    for(int i = 0; i < n - 1; ++i) {
        if(tmp[i] > m) {
            v.push_back(0);
            add.push_back(tmp[i]);
        } else v.push_back(tmp[i]);
    }
    sort(v.begin(), v.end());
    sort(add.begin(), add.end());
    reverse(add.begin(), add.end());/*
    for(auto x : v) cout << x << " ";
    cout << endl;
    for(auto x : add) cout << x << " ";
    cout << endl;*/
    int _add = add.size();
    int _v = v.size();
    int l = 0;
    for(int i = 0; i < _add; ++i) {
      //  l += d;
        if(l + d > _v) break;
        long long x = 0;
        for(int j = l; j < l + d; ++j) x += v[j];
        if(x < add[i]) {
            sum += add[i];
            l += d;
        } else break;
    }
    for(int i = l; i < _v; ++i) sum += v[i];
   // printf("value = %d
", sum);
    printf("%lld
", sum);
}

int main ()
{
  //  ios::sync_with_stdio(false);
  //  cin.tie(0); cout.tie(0);

    solve();

    return 0;
}