Pagini recente » Cod sursa (job #2282017) | Cod sursa (job #923523) | Cod sursa (job #2602816) | Cod sursa (job #2248965) | Cod sursa (job #135367)
Cod sursa(job #135367)
//gardieni
#include<fstream.h>
long int n,cost,t,a,b,d[1000001],c;
int main()
{int i,j;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
f>>n>>t;
for(i=1;i<=t;i++)
d[i]=2000000000;
for(i=1;i<=n;i++)
{f>>a>>b>>c;
for(j=a;j<=b;j++)
if(d[j]>c) d[j]=c;
}
for(i=1;i<=t;i++)
cost+=d[i];
g<<cost<<"\n";
f.close();
g.close();
return 0;
}