提出 #69317418

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;

int n, K;
int a[300000], b[300000], c[300000];

signed main() {
	int i;
	
	cin >> n >> K;
	rep(i, n)  { cin >> a[i] >> b[i] >> c[i]; }

	priority_queue<P, vector<P>, greater<P>> que; //(t, cnt)
	int cnt = 0, t = 0;

	rep(i, n) {
		t = max(t, a[i]);
		while (cnt + c[i] > K) {
			P now = que.top(); que.pop();
			cnt -= now.second;
			t = max(t, now.first);
		}
		cout << t << endl;
		cnt += c[i];
		que.push(P(t + b[i], c[i]));
	}
	return 0;
}

提出情報

ジャッジ結果