Pagini recente » Cod sursa (job #2929831) | Cod sursa (job #2036957) | Cod sursa (job #2417858) | Cod sursa (job #1896567) | Cod sursa (job #2081909)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
long int N,T,pret[1000010];
int main()
{ long int suma=0,i,j;
f>>N>>T;
for(i=1;i<=N;i++)
{ long int a,b,c;
f>>a>>b>>c;
//costul timpilor dintre a si b;
for(j=a;j<=b;j++)
{if(c<pret[j])pret[j]=c;
if(pret[j]==0)pret[j]=c;}
}
//calculam suma totala
for(i=1;i<=T;i++)
suma+=pret[i];
g<<suma;
f.close();
g.close();
return 0;
}