Cod sursa(job #125865)
Utilizator | Andrei Parvu andrei.12 | Data | 20 ianuarie 2008 19:46:23 |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<stdio.h>
int n, t, i, j, x, y, cst, d[1000005];
long long rezultat;
int main()
{
freopen("gardieni.in", "rt", stdin);
freopen("gardieni.out", "wt", stdout);
scanf("%d%d", &n, &t);
for (i = 1; i <= n; i ++){
scanf("%d%d%d", &x, &y, &cst);
for (j = x; j <= y; j ++)
if (cst < d[j] || !d[j])
d[j] = cst;
}
for (i = 1; i <= t; i ++)
rezultat += d[i];
printf("%lld\n", rezultat);
return 0;
}