Cod sursa(job #2075369)
Utilizator | Olivian Dan Cretu Olivian | Data | 25 noiembrie 2017 13:01:51 |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
long long cost[1000005],n,a,b,c,t;
long long s;
int main()
{
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
scanf("%lld %lld",&n,&t);
for(long long i=1;i<=n;i++)
{
scanf("%lld %lld %lld",&a,&b,&c);
for(long long j=a;j<=b;j++)
{
if(cost[j]>c || cost[j]==0) cost[j]=c;
}
}
for(long long i=1;i<=t;i++) s+=cost[i];
printf("%lld",s);
return 0;
}