Pagini recente » Cod sursa (job #1301107) | Cod sursa (job #1609473) | Cod sursa (job #2098346) | Cod sursa (job #2978465) | Cod sursa (job #754369)
Cod sursa(job #754369)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("gardieni.in");
ofstream out("gardieni.out");
const long long INF = 1 << 30;
long long V[1000010];
inline long long mn(long long a, long long b)
{
if(a < b)
return a;
return b;
}
int main()
{
long long N, T, i, j, st, dr, cost;
long long sol = 0;
in >> N >> T;
for(i = 1; i <= N; ++i)
V[i] = INF;
for(i = 1; i <= N; ++i){
in >> st >> dr >> cost;
for(j = st; j <= dr; ++j)
V[j] = mn(V[j], cost);
}
for(i = 1; i <= T; ++i)
sol += V[i];
out << sol;
return 0;
}