Pagini recente » Cod sursa (job #868686) | Cod sursa (job #240350) | Cod sursa (job #426157) | Cod sursa (job #3162579) | Cod sursa (job #1414824)
#include <fstream>
#define inf 1<<30
using namespace std;
ifstream fin("gardieni.in");
ofstream fout("gardieni.out");
long long total;
int n,i,j,a,b,c,cost[1000001],t;
int main()
{
fin>>n>>t;
for(i=1;i<=t;i++)
cost[i]=inf;
for(i=1;i<=n;i++)
{
fin>>a>>b>>c;
for(j=a;j<=b;j++)
cost[j]=min(cost[j],c);
}
for(i=1;i<=t;i++)
total+=cost[i];
fout<<total;
return 0;
}