제출 #233047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
233047		oolimry	Cake 3 (JOI19_cake3)	C++14	24 / 100	4061 ms	8388 KiB

cake3

#include <bits/stdc++.h>
#define C first
#define V second
using namespace std;
typedef pair<long long, long long> ii;


signed main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int n, m; cin >> n >> m;
	ii arr[n];
	for(int i = 0;i < n;i++) cin >> arr[i].V >> arr[i].C;
	
	sort(arr,arr+n);
	
	long long ans = -1e18;
	for(int s = 0;s < n;s++){
		priority_queue<long long, vector<long long>, greater<long long> > pq;
		long long acc = 0;
		for(int e = s+1;e < n;e++){
			if((int) pq.size() >= m - 2){
				if((int) pq.size() > m - 2){
					acc -= pq.top();
					pq.pop();
				}
				ans = max(ans, acc + arr[s].V + arr[e].V - 2*arr[e].C + 2*arr[s].C);
			}
			
			pq.push(arr[e].V);
			acc += arr[e].V;
		}
	}
	
	cout << ans;	
}

• Subtask 1: 5 / 5
• Subtask 2: 19 / 19
• Subtask 3: 0 / 76