Pagini recente » Cod sursa (job #3180699) | Cod sursa (job #802678) | Cod sursa (job #2901365) | Cod sursa (job #2304346) | Cod sursa (job #2075804)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("gardieni.in");
ofstream out("gardieni.out");
int main() {
long long n, t, v[1000000];
long long s=0;
in >> n >> t;
for (long i = 1; i <= n;i++) {
long a,b,c;
in >> a >> b >> c;
for (long j = a; j <= b; j++)
if (v[j] == 0 || v[j] > c)
v[j] = c;
}
for (long i = 1; i < t; i++) {
s += v[i];
}
out<<s;
return 0;
}