Cod sursa(job #611391)
| Utilizator | Data | 1 septembrie 2011 13:19:51 | |
|---|---|---|---|
| Problema | Gardieni | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream.h>
#define INF 1000001
#define N 50006
long n,t,a[N],b[N],c[N],i,j;
long long e,d[INF];
int main()
{ifstream f("gardieni.in");
ofstream g("gardieni.out");
f>>n>>t;
for(i=1;i<=n;i++)
f>>a[i]>>b[i]>>c[i];
for(i=1;i<=t;i++)
d[i]=INF;
for(i=1;i<=n;i++)
for(j=a[i];j<=b[i];j++)
if(c[i]<d[j])
d[j]=c[i];
for(i=1;i<=t;i++)
e+=d[i];
g<<e;
return 0;}
