Cod sursa(job #1975449)
Utilizator | Data | 30 aprilie 2017 23:17:04 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | usu1 | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f ("gardieni.in");
ofstream g ("gardieni.out");
int v[1000005],n,k,x,y,c;
long long t;
int main()
{
f>>n>>k;
for(int i=1;i<=n;++i)
{
f>>x>>y>>c;
for(int j=x;j<=y;++j) if(v[j]>c||!v[j]) t=t+c-v[j],v[j]=c;
}
g<<t;
return 0;
}