Submission #1242215

---

Source Code Expand

#include<iostream>
using namespace std;
const int MAX_N=100000;
const int MAX_M=100000;
int l[MAX_N],r[MAX_N],s[MAX_N];
int n,m;
long solve(int x){
  long res=0;
  for(int i=0;i<n;i++){
    if(l[i]<=x && x<=r[i])continue;
    res+=s[i];
  }
  return res;
}

int main(){
  cin>>n>>m;  
  for(int i=0;i<n;i++)
    cin>>l[i]>>r[i]>>s[i];

  long ans=0;
  for(int i=1;i<=m;i++)
    ans=max(ans,solve(i));
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result