Cod sursa(job #391391)
Utilizator | Login Iustin Anca login | Data | 5 februarie 2010 16:51:18 |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
# include <fstream>
# define INFINIT 1000000000
using namespace std;
int v[1000005], n, t;
int main ()
{
ifstream fin ("gardieni.in");
ofstream fout ("gardieni.out");
fin>>n>>t;
long long int ct=0;
for (int i=1;i<=t;i++)
v[i]=INFINIT;
int x, y, c;
for (;n;--n)
{
fin>>x>>y>>c;
for (int j=x;j<=y;j++)
if (c<v[j])
v[j]=c;
}
for (int i=1;i<=t;i++)
ct+=v[i];
fout<<ct;
return 0;
}