Pagini recente » Cod sursa (job #3002886) | Cod sursa (job #3207483) | Cod sursa (job #2120105) | Borderou de evaluare (job #248840) | Cod sursa (job #2651173)
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("gardieni.in");
ofstream so("gardieni.out");
int sol[1000005];
int main() {
int n, t;
int a, b, c;
long long sum=0;
si>>n>>t;
for(int i=1; i<=t; i++)
sol[i]=2000000000;
for(int i=1; i<=n; i++) {
si>>a>>b>>c;
for(int j=a; j<=b; j++)
sol[j]=min(sol[j], c);
}
for(int i=1; i<=t; i++)
sum+=sol[i];
so<<sum;
return 0;
}