Cod sursa(job #1206271)
| Utilizator | Data | 9 iulie 2014 13:21:58 | |
|---|---|---|---|
| Problema | Gardieni | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream in("gardieni.in");
ofstream out("gardieni.out");
int n,t,a,b,c,cmin[1000009];
long long sol;
int main()
{
in>>n>>t;
for(int i=1; i<=t; i++) cmin[i]=(1<<20)+10;
for(int i=1; i<=n; i++)
{
in>>a>>b>>c;
for(int j=a; j<=b; j++)
if(c<cmin[j]) cmin[j]=c;
}
for(int i=1; i<=t; i++) sol+=cmin[i];
out<<sol<<'\n';
out.close();
return 0;
}
