Cod sursa(job #426132)
Utilizator | Nitu Doru Constantin doru.nitu | Data | 26 martie 2010 14:44:34 |
---|---|---|---|
Problema | Gardieni | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
int i,j,min[1<<20],a,b,c,n,t;
long long rez;
int main()
{
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
scanf("%d %d",&n,&t);
for(i=1;i<=n;++i)
{
scanf("%d%d%d",&a,&b,&c);
for(j=a;j<=b;++j)
if(!min[j]||min[j]>c) min[j]=c;
}
for(i=1;i<=t;++i)
rez=rez+(long long)(min[i]);
printf("%d\n",rez);
fclose(stdin);
fclose(stdout);
return 0;
}