Cod sursa(job #1224377)
Utilizator | Data | 30 august 2014 19:49:24 | |
---|---|---|---|
Problema | Gardieni | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
int n,t,a,b,c,k[1000009];
long long sol;
int main()
{
f>>n>>t;
for(int i=1; i<=t; i++)
k[i]=(1<<20)+10;
for(int i=1; i<=n; i++)
{
f>>a>>b>>c;
for(int j=a; j<=b; j++)
if(c<k[j]) k[j]=c;
}
for(int i=1; i<=t; i++)
sol+=k[i];
g<<sol<<'\n';
return 0;
}