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;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
long long findMaxAttraction(int n, int s, int d, int a[]) {
long long res = (long long) -9e18;
assert(s == 0);
priority_queue<long long, vector<long long>, greater<long long>> pq;
long long sum = 0;
for (int i = 0; i < n; i++) {
pq.emplace(a[i]);
sum += a[i];
while ((int) pq.size() + i > d) {
sum -= pq.top();
pq.pop();
}
res = max(res, sum);
}
return res;
}
#ifdef tabr
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
return 0;
}
#endif
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |