Pagini recente » Clasament bulangandit6 | Cod sursa (job #1878379) | Cod sursa (job #363345) | Cod sursa (job #1505027) | Cod sursa (job #155246)
Cod sursa(job #155246)
#include <fstream>
using namespace std;
ofstream ofis;
ifstream ifis;
int main(void)
{
ofis.open("gardieni2.txt");
ifis.open("gardieni1.txt");
unsigned int n;
long t,cost_total,i,j,min;
long a[50005],b[50005],c[50005],minim[50005];
ifis>>n>>t;
for (int i=0; i<=n; i++)
ifis>>a[i]>>b[i]>>c[i];
for (int i=0; i<=t; i++)
{
min=2000000000;
for (int j=0; j<=n; j++)
if (i>=a[j] && i<=b[j])
if (c[j]<min) minim[i]=c[j];
}
cost_total=0;
for (int i=0; i<=t; i++)
cost_total+=minim[i];
ofis<<cost_total;
return 0;
}