Cod sursa(job #155246)

Utilizator razvan_emPrecupas Razvan razvan_em Data 11 martie 2008 20:22:53
Problema Gardieni Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.65 kb
#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;
}