Cod sursa(job #124893)
Utilizator | Robert Sandu Mirage | Data | 20 ianuarie 2008 09:58:09 |
---|---|---|---|
Problema | Gardieni | Scor | 20 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 3, Clasa a 10-a | Marime | 0.41 kb |
#include<stdio.h>
int min[1000000];
int main () {
int i,n,t,a,b,c,s=0,x=0,j;
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
scanf("%d%d",&n,&t);
for(i=0;i<t;i++)
min[i]=1000000;
for(i=0;i<n;i++){
scanf("%d%d%d",&a,&b,&c);
for(j=0;j<t&&j+1<=b;j++)
if(j+1>=a)
if(min[j]>c)
min[j]=c;
x++;
}
for(i=0;i<t;i++)
s+=min[i];
printf("%d\n",s);
return 0;
}