#include "bits/stdc++.h"
#include"holiday.h"
using namespace std;
#define ll long long
const int N = 2e5 + 10;
ll c[N], sum[4 * N], cnt[4 * N];
ll query(int i, int l, int r, int k) {
if(l > r || k <= 0) return 0;
if(cnt[i] <= k) return sum[i];
int mid = l + r >> 1;
if(cnt[2 * i] > k) return query(2 * i, l, mid, k);
return sum[2 * i] + query(2 * i + 1, mid + 1, r, k - cnt[2 * i]);
}
void modif(int i, int l, int r, int pos, bool b) {
if(l > pos || r < pos) return;
if(l == pos && r == pos) {
sum[i] = (b ? c[l] : 0);
cnt[i] = b;
return;
}
int mid = l + r >> 1;
modif(2 * i, l, mid, pos, b);
modif(2 * i + 1, mid + 1, r, pos, b);
sum[i] = sum[2 * i] + sum[2 * i + 1];
cnt[i] = cnt[2 * i] + cnt[2 * i + 1];
}
long long int findMaxAttraction(int n, int start, int d, int a[]) {
vector<pair<int, int>> x;
for(int i = 0; i < n; ++i) x.push_back({a[i], i});
sort(x.rbegin(), x.rend());
vector<int> pos(n, -1);
for(int i = 0; i < n; ++i) {
c[i] = x[i].first;
pos[x[i].second] = i;
}
ll ans = 0;
for(int i = 0; i < n && d; ++i) {
assert(0 <= pos[i] && pos[i] <= n - 1);
modif(1, 0, n - 1, pos[i], 1);
ans = max(ans, query(1, 0, n - 1, d));
--d;
}
return ans;
}
