Cod sursa(job #2792356)
Utilizator | Data | 1 noiembrie 2021 15:00:12 | |
---|---|---|---|
Problema | Gardieni | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
int v[1000005],n,k,x,y,c,i,j;
long long t;
int main()
{
for(f>>n>>k,i=1;i<=n;++i)
for(f>>x>>y>>c,j=x;j<=y;++j)
if(v[j]>c||!v[j])
t+=c-v[j],v[j]=c;
g<<t;
return 0;
}