Cod sursa(job #391396)
| Utilizator | Data | 5 februarie 2010 17:00:37 | |
|---|---|---|---|
| Problema | Gardieni | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int n,t;
int v[1000000];
int main()
{
ifstream fin("gardieni.in");
ofstream fout("gardieni.out");
fin>>n>>t;
int i;
for(i=1;i<=t;i++)
v[i]=1000000;
for(i=1;i<=n;i++)
{
int a,b,c;
fin>>a>>b>>c;
for(int j=a;j<=b;j++)
if(v[j]>c)
v[j]=c;
}
long long suma=0;
for(i=1;i<=t;i++)
suma+=v[i];
fout<<suma;
return 0;
}
