# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763654 | Ahmed57 | 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"holiday.h"
#include <bits/stdc++.h>
using namespace std;
long long int findMaxAttraction(int n, int start, int d,
int attraction[]){
if(d==0){
priority_queue<long long> q;
long long sum = 0 , ma = 0;
for(int i = 0;i<n;i++){
q.push(-arr[i]);
sum+=arr[i];
while(q.size()>(d-i)){
sum+=q.top();
q.pop();
}
ma = max(ma,sum);
}
return ma;
}
return 0;
}
/*
int main(){
int S[] = {3,4};
cout<<countReplacement(2,S);
}*/