# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104730 | antimirage | Cake 3 (JOI19_cake3) | C++14 | 3 ms | 384 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 <bits/stdc++.h>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 2005;
int n, m;
long long ans;
pair <int, int> a[N];
multiset <int> st;
main(){
cin >> n >> m;
for (int i = 1; i <= n; i++)
scanf("%d%d", &a[i].sc, &a[i].fr);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++){
long long sum = 0;
st.clear();
for (int j = i; j <= n; j++){
if ((int)st.size() < m)
sum += a[j].sc,
st.insert( a[j].sc );
else if (*st.begin() < a[j].sc){
sum -= *st.begin();
st.erase(st.begin());
sum += a[j].sc;
st.insert( a[j].sc );
}
if ((int)st.size() == m)
ans = max(ans, sum - (a[j].fr - a[i].fr) * 2);
}
}
cout << ans << endl;
}
/**
5 3
2 1
4 2
6 4
8 8
10 16
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |