Pagini recente » Cod sursa (job #2679863) | Cod sursa (job #2215670) | Cod sursa (job #193636) | Cod sursa (job #1702735) | Cod sursa (job #131067)
Cod sursa(job #131067)
#include <stdio.h>
#define in "gardieni.in"
#define out "gardieni.out"
#define NMAX 50010
#define _INF (1<<31 - 1)
int n, T;
long int cost, minim[NMAX];
int X[NMAX];
int Y[NMAX];
int C[NMAX];
int main()
{
freopen( in, "r", stdin );
freopen( out, "w", stdout );
scanf( "%d%d", &n, &T );
int i,j,k;
for ( i = 1; i <= n; ++i ) {scanf( "%d%d%d", &X[i], &Y[i], &C[i] ); }
for ( i = 1; i <= T; ++i ) { minim[i] = _INF; }
for ( i = 1; i <= n; ++i ) //pt fiecare interval
{
for ( j = X[i]; j <= Y[i]; ++j )
if ( C[i] < minim[j] )
minim[j] = C[i];
}
cost = 0;
for ( i = 1; i <= T; ++i )
cost += minim[i];
printf( "%d", cost );
return 0;
}