Cod sursa(job #135373)
Utilizator | Catalina Predoi hazegirl | Data | 13 februarie 2008 18:33:14 |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
//gardieni
#include<fstream.h>
long int n,t,a,b,d[1000001],c;
long long int cost;
int main()
{long int i,j;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
f>>n>>t;
for(i=1;i<=t;i++)
d[i]=2000000000;
for(i=1;i<=n;i++)
{f>>a>>b>>c;
for(j=a;j<=b;j++)
if(d[j]>c) d[j]=c;
}
for(i=1;i<=t;i++)
cost+=d[i];
g<<cost<<"\n";
f.close();
g.close();
return 0;
}