Cod sursa(job #1392174)
Utilizator | Data | 18 martie 2015 13:47:35 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
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 cost[1000001];
int main()
{
int n,t,i,j,a,b,c;
fin>>n>>t;
for(i=1;i<=n;i++)
{
fin>>a>>b>>c;
for(j=a;j<=b;j++)
{
if(cost[j]==0||cost[j]>c) cost[j]=c;
}
}
long long sol=0;
for(i=1;i<=t;i++) sol+=cost[i];
fout<<sol;
}