#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define F first
#define S second
#define ll long long
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back
#define ull unsigned ll
const int MAX=1e5+55;
const int inf=1e9;
const int N=2e5;
const int C=331;
const int C1=431;
const int mod=1e9+9;
const int mod1=1e9+9;
#include "holiday.h"
long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
multiset<int> st;
int ans=0;
int cur=0;
for(int i=0;i<n;i++){
st.in(attraction[i]);
cur+=attraction[i];
while(!st.empty()&&sz(st)>d-i){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans,cur);
}
return ans;
}
