Pagini recente » Cod sursa (job #1465964) | Cod sursa (job #1377388) | Cod sursa (job #1218174) | Cod sursa (job #2151729) | Cod sursa (job #2080370)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
long int N,T,pret[1000001];
int main()
{ long int i,j;
float suma=0;
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;
else if(pret[j]==0)pret[j]=c;
}
//calculam suma totala
for(i=1;i<=T;i++)
suma+=pret[i];
g<<suma;
return 0;
}