1395D - Boboniu Chats with Du - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	int n, d, m;
	cin >> n >> d >> m;
	vector<LL> a, b;
	for (int i = 0; i < n; i ++ ){
		int x;
		cin >> x;
		if (x > m){
			a.push_back(x);
		}
		else{
			b.push_back(x);
		}
	}
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	a.push_back(0);
	b.push_back(0);
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	for (int i = 1; i < a.size(); i ++ ){
		a[i] += a[i - 1];
	}
	for (int i = 1; i < b.size(); i ++ ){
		b[i] += b[i - 1];
	}
	
	LL ans = b.back();
	for (int i = 1; i < a.size(); i ++ ){
		int cnt = (i - 1) * (d + 1) + 1;
		if (cnt > n) break;
		
		ans = max(ans, a[i] + b[min(int(b.size()) - 1, n - cnt)]);
	}
	cout << ans << "\n";
	return 0;
}