Cod sursa(job #2075763)
Utilizator | Data | 25 noiembrie 2017 17:32:42 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
int n,i,a,b,v[1000001],t,c,j;
long long s;
int main()
{
f>>n>>t;
for(i=1; i<=n; i++)
{
f>>a>>b>>c;
for(j=a; j<=b; j++)
{
if(v[j]==0 or v[j]>c)
{
v[j]=c;
}
}
}
s=0;
for(i=1; i<=t; i++)
{
s=s+v[i];
}
g<<s<<'\n';
return 0;
}