Cod sursa(job #2081911)
| Utilizator | Data | 5 decembrie 2017 13:35:14 | |
|---|---|---|---|
| Problema | Gardieni | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#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,i,w;
f>>N;
f>>T;
for(i=1;i<=N;i++)
{ long int a,b,c;
f>>a>>b>>c;
//costul timpilor dintre a si b;
for(w=a;w<=b;w++)
{if(c<pret[w])pret[w]=c;
if(pret[w]==0)pret[w]=c;}
}
suma=0;
//calculam suma totala
for(i=1;i<=T;i++)
suma+=pret[i];
g<<suma;
f.close();
g.close();
return 0;
}