Submission #1627461

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <array>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>

#define INT_MAX 2000000000
#define MOD 1000000007
#define ll long long
#define rep(i,a,b) for(i = (a); i < (b); i++)
#define bitget(a,b) (((a) >> (b)) & 1)

using namespace std;



int main() {
	int i, j, k;
	int n, m;
	cin >> n >> m;
	int l[100000], r[100000], s[100000];
	rep(i, 0, n)
		cin >> l[i] >> r[i] >> s[i];
	int a[100001] = {};
	ll int ans = 0;
	rep(i, 0, n) {
		ans += s[i];
		a[l[i]-1] += s[i];
		a[r[i]] -= s[i];
	}
	int min = INT_MAX;
	rep(i, 0, m) {
		a[i + 1] += a[i];
		if (min > a[i]) {
			min = a[i];
		}
	}
	cout << ans - min << endl;
	return 0;
}

Submission Info

Judge Result