Pagini recente » Cod sursa (job #2832625) | Istoria paginii runda/lastofjune/clasament | Cod sursa (job #2620200) | Cod sursa (job #2964790) | Cod sursa (job #2968378)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream in("gardieni.in");
ofstream out("gardieni.out");
int n, m;
int sol[1000001];
signed main()
{
in >> n >> m;
for(int i = 1; i <= m; i++)
sol[i] = INT_MAX;
for(int i = 1; i <= n; i++)
{
int a, b, c;
in >> a >> b >> c;
for(int j = a; j <= b; j++)
sol[j] = min(sol[j], c);
}
int rasp = 0;
for(int i = 1; i <= m; i++)
rasp += sol[i];
out << rasp;
return 0;
}