Pagini recente » Cod sursa (job #1697415) | Cod sursa (job #963590) | Cod sursa (job #2058868) | Cod sursa (job #1176189) | Cod sursa (job #2074902)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("Gardienii.in");
ofstream g("Gardienii.out");
int main()
{
long int s=0, smax=INT_MAX, Smax=0, N, T, i, j;
f>>N>>T;
struct segment{int a, b, c;}S[50006];
for(i=1; i<=N; i++)f>>S[i].a>>S[i].b>>S[i].c;
for(i=1; i<=T; i++)
{
for(j=1; j<=N; j++)
{
if(S[j].a<=T && T<=S[j].b)s=S[j].c;
if(s<smax) smax=s;
}
Smax+=smax;
smax=INT_MAX;
}
g<<Smax;
return 0;
}