Pagini recente » Cod sursa (job #1220660) | Cod sursa (job #1611595) | Cod sursa (job #1168816) | Cod sursa (job #2758596) | Cod sursa (job #994795)
Cod sursa(job #994795)
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define INF 20 >> 1
#define LL long long
#define NMAX 1000007
using namespace std;
LL v[NMAX], Sum, s;
int n, t, x, y;
int main(){
freopen("gardieni.in", "r", stdin);
freopen("gardieni.out", "w", stdout);
scanf("%d %d", &n, &t);
for(int i = 1; i <= n; ++ i){
scanf("%d %d %lld", &x, &y, & s);
for(; x <= y; ++ x){
v[x] = min(v[x], s);
if(v[x] == 0)
v[x] = s;
}
}
for(int i = 1; i <= t; ++ i)
Sum += v[i];
printf("%lld", Sum);
return 0;
}