Cod sursa(job #2080372)
| Utilizator | Data | 2 decembrie 2017 20:50:28 | |
|---|---|---|---|
| Problema | Gardieni | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
long int N,T,pret[10000001];
int main()
{ long int i,j,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;
}
