Submission #950529

#	Time	Username	Problem	Language	Result	Execution time	Memory
950529		hengliao	Holiday (IOI14_holiday)	C++17	23 / 100	22 ms	5468 KiB

holiday

#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(int n, int s, int d, int a[]){
    ll ans=0;
    if(s==0){
        multiset<ll> st;
        ll cur=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--;
        }
        
    }
    return ans;
}

/*int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll a[5]={10, 2, 20, 30, 1};

    cout<<findMaxAttraction(5, 0, 7, a);
    return 0;
}*/

• Subtask 1: 0 / 7
• Subtask 2: 23 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53