Cod sursa(job #228716)

Utilizator AndreiDDiaconeasa Andrei AndreiD Data 7 decembrie 2008 21:05:08
Problema Gardieni Scor 0
Compilator c Status done
Runda Arhiva de probleme Marime 0.66 kb
#include <stdio.h>         
      
#define INFINIT 20000000         
        
long N;         
long long X[1<<20],Y[1<<20],C[1<<20],minim[1<<16],rez,T,i,j;         
      
int main()         
{         
freopen("gardieni.in","r",stdin);
scanf("%ld %lld\n", &N, &T);
for (i=1;i<=N;++i)
     scanf("%lld %lld %lld\n", &X[i], &Y[i], &C[i]);   
for (i=1;i<=T;++i)
     minim[i]=INFINIT;
for (i=1;i<=N;++i)
     {
     for (j=X[i];j<=Y[i];++j)
     if (minim[j]>C[i])
         minim[j]=C[i];
      }
rez=0;
for (i=1;i<=T;++i)
    rez+=minim[i];         
freopen("gardieni.out","w",stdout);
printf("%lld\n", rez);         
return 0;         
}