Cod sursa(job #721113)
Utilizator | Data | 23 martie 2012 12:08:32 | |
---|---|---|---|
Problema | Gardieni | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
#define NMAX 1000000
const int MN=1<<21;
ifstream in("gardieni.in");
ofstream out("gardieni.out");
int main()
{
int n,t,v[NMAX],a,b,c;
int i,j;
long long S=0;
in>>n>>t;
for (i=1;i<=t;i++)
v[i]=MN;
for (i=1;i<=n;i++)
{
in>>a>>b>>c;
for (j=a;j<=b;j++)
v[j]=min(v[j],c);
}
for (int i=1;i<=t;i++)
S+=v[i];
out<<S;
return 0;
}