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