Submission #1242235

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N = 100010;
long long int l[MAX_N], r[MAX_N], s[MAX_N], solve[MAX_N];
int n, m;

int main(){
  cin >> n >> m;
  long long int sum = 0, mini = 1e9;
  for(int i = 0; i < n; i++){
    cin >> l[i] >> r[i] >> s[i];
    solve[l[i] - 1] += s[i];
    solve[r[i]] -= s[i];
    sum += s[i];
  }
  for (int i = 0; i < n; i++) {
    solve[i + 1] += solve[i];
  }
  long long int ans = 0;
  for(int i = 0; i < n; i++){
    mini = min(solve[i], mini);
  }
  cout << sum - mini << endl;
  return 0;
}

Submission Info

Judge Result