Pagini recente » Cod sursa (job #1789855) | Cod sursa (job #2515931) | Cod sursa (job #2841459) | Cod sursa (job #1515953) | Cod sursa (job #1350750)
#include <iostream>
#include <fstream>
using namespace std;
int n, t, timp[1000100], a, b, c, i, j;
long long s;
int main()
{
ifstream f("gardieni.in");
ofstream g("gardieni.out");
f >> n >> t;
for (i = 1; i <= t; i++)
timp[i] = 1 << 30;
for (i = 1; i <= n; i++)
{
f >> a >> b >> c;
for (j = a; j <= b; j++)
{
if (timp[j] > c)
timp[j] = c;
}
}
for (i = 1; i <= t; i++)
s += timp[i];
g << s;
}