Pagini recente » Cod sursa (job #1923142) | Cod sursa (job #999412) | Cod sursa (job #950399) | Cod sursa (job #1553297) | Cod sursa (job #2700877)
#include <fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
int n,t,a,b,c,sol[1000005];
long long sum=0;
int main()
{
f>>n>>t;
for(int i=1; i<=t; i++)
{
sol[i]=2000000000;
}
for(int i=1; i<=n; i++)
{
f>>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];
}
g<<sum<<'\n';
return 0;
}