# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950517 | hengliao | Holiday (IOI14_holiday) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;
ll findMaxAttraction(ll n, ll s, ll d, ll a[]){
if(s==0){
set<ll> st;
ll cur=0;
ll ans=0;
for(ll i=0;i<n;i++){
if(d<=0) break;
st.insert(a[i]);
cur+=a[i];
while(st.size()>d){
cur-=*st.begin();
st.erase(st.begin());
}
ans=max(ans, cur);
d--;
}
cout<<ans<<'\n';
}
}
/*int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}*/