Cod sursa(job #125096)
Utilizator | Victor Popescu slayer4u | Data | 20 ianuarie 2008 11:21:35 |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 3, Clasa a 10-a | Marime | 0.43 kb |
#include <stdio.h>
long long sum;
long i, n, t, j, a, b, c, T[1000100];
int main()
{
freopen ("gardieni.in", "rt", stdin);
freopen ("gardieni.out", "wt", stdout);
scanf("%ld %ld", &n, &t);
for (i = 1; i <= n; i ++)
{
scanf("%ld %ld %ld", &a, &b, &c);
for (j = a; j <= b; j ++)
if (T[j] > c || T[j] == 0)
T[j] = c;
}
for (i = 1; i <= t; i ++)
sum += T[i];
printf("%lld\n", sum);
return 0;
}