Cod sursa(job #126866)
Utilizator | Data | 22 ianuarie 2008 22:02:42 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<stdio.h>
int min[1001000];
int main(){
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
int n,t,a,b,c,i,j;
long long sum;
scanf("%d%d",&n,&t);
for(i=0;i<n;++i){
scanf("%d%d%d",&a,&b,&c);
for(j=a;j<=b;++j){
if(min[j]==0)
min[j]=c;
else{
if(min[j]>c)
min[j]=c;
}
}
}
sum=0;
for(i=1;i<=t;++i)
sum+=(long long)min[i];
printf("%lld\n",sum);
fclose(stdin);
fclose(stdout);
return 0;
}