Pagini recente » Cod sursa (job #2724299) | Cod sursa (job #3171255) | Cod sursa (job #2851306) | Cod sursa (job #3175397) | Cod sursa (job #200297)
Cod sursa(job #200297)
#include<stdio.h>
#define nmax 1000002
long long sol[nmax];
int main()
{
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
int N,T;
int i,j;
int a1,a2;long long a3,a,solfin=0;
scanf("%d%d",&N,&T);
for(i=1; i<=N; ++i){
scanf("%d%d%lld",&a1,&a2,&a3);
for(j=a1; j<=a2; ++j){
a=sol[j];
if( !a || a>a3 )
sol[j]=a3;
}
}
for(i=1; i<=T; ++i)
solfin+=sol[i];
printf("%lld\n",solfin);
return 0;
}