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