Pagini recente » Cod sursa (job #449573) | Cod sursa (job #2120974) | Cod sursa (job #2202872) | Cod sursa (job #1846493) | Cod sursa (job #2075353)
#include <fstream>
using namespace std;
long int v[1000001], n, t;
int main()
{
ifstream f("gardieni.in");
ofstream g("gardieni.out");
f >> n >> t;
for(long int i = 0; i < n; i++)
{
long int a, b, c;
f >> a >> b >> c;
for(long int j = a; j <= b; j++)
if(v[j] == 0 || v[j] > c)
v[j] = c;
}
long int s = 0;
for(long int j = 1; j <= t; j++)
s+=v[j];
g << s;
return 0;
}