Cod sursa(job #2075792)
Utilizator | Micu Florian-Luis luis.micu | Data | 25 noiembrie 2017 17:45:27 |
---|---|---|---|
Problema | Gardieni | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("gardieni.in");
ofstream out("gardieni.out");
int main() {
long n, t, a, b, c, v[100000];
long long s=0;
in >> n >> t;
for (long i = 1; i <= n;i++) {
in >> a >> b >> c;
for (long j = a; j <= b; j++)
if (v[j] == 0 || v[j] > c)
v[j] = c;
}
for (long i = 1; i <= t; i++) {
s += v[i];
}
out<<s;
return 0;
}