#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
struct KthLargest{
priority_queue<int, vector<int>, greater<int>> pq;
ll sum = 0;
KthLargest(){}
void add(int x){
sum += x;
pq.push(x);
}
ll get(int k){
while(pq.size() > k){
sum -= pq.top(); pq.pop();
}
return sum;
}
};
ll findMaxAttraction(int n, int start, int d, int a[]){
ll ans = 0;
for(int i = start; i>=0; --i){
KthLargest pq;
for(int j = i; j <= start; ++j) pq.add(a[j]);
int dis1 = start - i;
if (dis1 > d) break;
maximize(ans, pq.get(d - dis1));
for(int j = start + 1; j < n; ++j){
pq.add(a[j]);
int dis2 = j - start;
int cur_dis = dis1 + dis2 + min(dis1, dis2);
if (cur_dis > d) break;
maximize(ans, pq.get(d - cur_dis));
}
}
return ans;
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// clock_t start = clock();
// int n, s, d;
// cin >> n >> s >> d;
// int attraction[n];
// for(int i = 0; i<n; ++i) cin >> attraction[i];
// cout << findMaxAttraction(n, s, d, attraction) << "\n";
// cerr << "Time elapsed: " << clock() - start << " ms\n";
// return 0;
// }
