# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950520 | 2024-03-20T11:37:48 Z | hengliao | Holiday (IOI14_holiday) | C++17 | 0 ms | 0 KB |
#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; ll siz=0; for(ll i=0;i<n;i++){ if(d<=0) break; st.insert(a[i]); cur+=a[i]; siz++; while(siz>d){ cur-=*st.begin(); st.erase(st.begin()); siz--; } 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; }*/