Pagini recente » Cod sursa (job #2742162) | Borderou de evaluare (job #2593669) | Cod sursa (job #454582) | Cod sursa (job #1081778) | Cod sursa (job #847193)
Cod sursa(job #847193)
#include<algorithm>
#include<cstdio>
using namespace std;
int s,k,v[1000005],a,b,n,i,j,m;
int main()
{
freopen("gardieni.in","r",stdin);
freopen("gardieni.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&a,&b,&k);
for (j=a;j<=b;j++) if (v[j]==0) s+=k,v[j]=k;else s-=v[j],v[j]=k,s+=k;
}
printf("%d\n",s);
return 0;
}