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