Cod sursa(job #124894)
Utilizator | Casu-Pop Bogdan bogdanhm999 | Data | 20 ianuarie 2008 09:58:23 |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 3, Clasa a 10-a | Marime | 0.49 kb |
#include <stdio.h>
#define inf 2000000000
long n,t,i,j,x,y,z,a[1000002];
long long suma;
int main(){
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
scanf("%ld %ld",&n,&t);
for (i=1;i<=t;i++)a[i]=inf;
for (i=1;i<=n;i++){
scanf("%ld %ld %ld",&x,&y,&z);
for (j=x;j<=y;j++)if (z<a[j])a[j]=z;
}
for (i=1;i<=t;i++)suma=(long long)suma+a[i];
printf("%lld\n",suma);
return 0;
}