Cod sursa(job #2091960)
Utilizator | Data | 20 decembrie 2017 18:08:46 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define VAL 1000005
using namespace std;
ifstream fin("gardieni.in");
ofstream fout("gardieni.out");
int N, T, i, j;
int nr[VAL], A, B, C;
long long ANS;
int main()
{
fin >> N >> T;
for (i=1; i<=T; i++)
{
nr[i]=1 << 25;
ANS+=nr[i];
}
for (i=1; i<=N; i++)
{
fin >> A >> B >> C;
for (j=A; j<=B; j++)
{
if (nr[j]>C)
{
ANS+=C-nr[j];
nr[j]=C;
}
}
}
fout << ANS << '\n';
fin.close();
fout.close();
return 0;
}