Cod sursa(job #2208744)

Utilizator MoldooooooooMoldoveanu Stefan Moldoooooooo Data 31 mai 2018 10:12:10
Problema Gardieni Scor 20
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.41 kb
#include <fstream>
using namespace std;
ifstream fin("gardieni.in");
ofstream fout("gardieni.out");
int N, T, a, b, c, Cheap[1000002], i, k, S;
int main()
{
    fin>>N>>T;
    for(i=0; i<N; i++){
       fin>>a>>b>>c;
       for(k=a; k<=b; k++){
        if(Cheap[k]==0)Cheap[k]=c;
        else if(Cheap[k]>c)Cheap[k]=c;
       }
    }
    for(i=1; i<=T; i++)S+=Cheap[i];
    fout<<S;
    return 0;
}