Pagini recente » Cod sursa (job #2904371) | Cod sursa (job #2226417) | Cod sursa (job #243342) | Cod sursa (job #2891941) | Cod sursa (job #2080342)
#include<iostream>
#include<fstream.h>
#include<math.h>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
unsigned long int pret[1000001],N,T;
long double c;
int main()
{ int suma=0,i,a,b,c,t;
f>>N>>T;
for(i=1;i<=N;i++)
{f>>a>>b>>c;t=0;
//costul timpilor dintre a si b;
for(int j=a;j<=b;j++)
if(c<pret[j] || pret[j]==0)pret[j]=c;
}
//calculam suma totala
for(i=1;i<=T;i++)
suma+=pret[i];
g<<suma;
return 0;
}