# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
950525 | 2024-03-20T11:41:16 Z | hengliao | 휴가 (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 ll ll; ll findMaxAttraction(int n, int s, int d, int a[]){ ll ans=0; if(s==0){ set<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; }*/