Cod sursa(job #274615)
Utilizator | Data | 9 martie 2009 21:22:41 | |
---|---|---|---|
Problema | Gardieni | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <cstdio>
#include <climits>
#define MAX LONG_MAX
long v[1000010], a, b, c, t, n;
int main ()
{
int i;
FILE *f = fopen("gardieni.in", "r");
fscanf(f, "%ld%ld", &n, &t);
for (i = 1; i <= t; i++)
v[i] = MAX;
for (int s = 1; s <= n; s++)
{
fscanf(f, "%ld%ld%ld", &a, &b, &c);
for (i = a; i <= b; i++)
if (c < v[i])
v[i] = c;
}
fclose(f);
long sum = 0;
for (i = 1; i <= t; i++)
sum += v[i];
f = fopen("gardieni.out", "w");
fprintf(f, "%ld", sum);
fclose(f);
return 0;
}