Submission #349090

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
using namespace std;
int main() {
  int n,m; cin >> n >> m;
  pair<int, pair<int,int> > p[n];
  rep(i,n) cin >> p[i].second.first >> p[i].second.second >> p[i].first;
  sort(p,p+n);
  ll res = 0;
  rep(i,m) {
    ll tmp = 0;
    rep(j,n) {
      if (p[j].second.first > i+1 || p[j].second.second < i+1) 
	tmp += p[j].first;
    }
    res = max(res,tmp);
  }
  cout << res << endl;
  return 0;
}

Submission Info

Judge Result