#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
const int64_t inf = 1e15;
int n, m;
std::cin >> n >> m;
std::vector<std::pair<int64_t, int64_t>> a(n); // (c, v)
for (auto &[c, v] : a) {
std::cin >> v >> c;
}
std::sort(a.begin(), a.end());
int64_t ans = -inf;
for (int i = 0; i < n; ++i) {
std::multiset<int64_t> st;
int64_t sum = 0;
auto add = [&](int64_t x) {
if (st.size() + 1 <= m - 2) {
st.insert(x);
sum += x;
return;
}
if (x > *st.begin()) {
sum += -*st.begin() + x;
st.erase(st.begin());
st.insert(x);
}
};
for (int j = i + 1; j < i + m - 1; ++j) {
add(a[j].second);
}
for (int j = i + m - 1; j < n; ++j) {
ans = std::max(ans, a[i].second + sum + a[j].second - 2 * (a[j].first - a[i].first));
add(a[j].second);
}
}
std::cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |