Cod sursa(job #125916)
Utilizator | Data | 20 ianuarie 2008 21:16:32 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <stdio.h>
long long v[1100000], n, a, b, c, cost, t;
int main()
{
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
long long i, j;
scanf("%lld %lld",&n, &t);
for (i = 1; i <= n; i++)
{
scanf("%lld %lld %lld", &a, &b, &c);
for (j = a; j <= b; j++) if (!v[j] || v[j] > c) v[j] = c;
}
for (i = 1; i <= t; i++) cost += v[i];
printf("%lld\n",cost);
return 0;
}