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