제출 #376788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376788		casperwang	Cake 3 (JOI19_cake3)	C++14	0 / 100	1 ms	364 KiB

cake3

#include <bits/stdc++.h>
#define int long long
#define All(x) x.begin(), x.end()
#define tiiii tuple<int,int,int,int>
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 200000;
int N, M;
pii arr[MAXN+1];
int ans;

void solve() {
	priority_queue <int, vector<int>, greater<int>> val;
	for (int i = 1; i <= N; i++) {
		int sum = arr[i].ff + arr[i].ss * 2;
		for (int j = i+1; j <= N; j++) {
			sum += arr[j].ff;
			val.push(arr[j].ff);
			if (val.size() + 1 > M) {
				sum -= val.top();
				val.pop();
			}
			ans = max(ans, sum - 2 * arr[j].ss);
		}
		while (val.size()) val.pop();
	}
}

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		auto &[v, c] = arr[i];
		cin >> v >> c;
	}
	sort(arr+1, arr+1+N, [](const pii a, const pii b) {
		return a.ss < b.ss;
	});
	solve();
	cout << ans << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

cake3.cpp: In function 'void solve()':
cake3.cpp:26:23: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   26 |    if (val.size() + 1 > M) {
      |        ~~~~~~~~~~~~~~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:40:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   40 |   auto &[v, c] = arr[i];
      |         ^

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