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