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