Cod sursa(job #2084616)
| Utilizator | Data | 9 decembrie 2017 11:07:17 | |
|---|---|---|---|
| Problema | Gardieni | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
long long N,T,pret[1000001];
int main()
{ long long suma=0,i,j;
f>>N>>T;
for(i=1;i<=N;i++)
{ long long c;
long a,b;
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;
}
