Cod sursa(job #2074980)
Utilizator | Data | 25 noiembrie 2017 10:29:08 | |
---|---|---|---|
Problema | Gardieni | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("gardieni.in");
ofstream g("gardieni.out");
long int N,T,i,j,jj,cost,mini;
struct segment{long int a,b,c;}S[50005];
int main()
{
f>>N;
f>>T;
for(i=1;i<=N;i++)
{
f>> S[i].a >> S[i].b >> S[i].c;
}
for(i=1;i<=T;i++)
{
mini=2097152;
for(j=1;j<=N;j++)
if(S[j].a <=i && S[j].b >=i)
if(S[j].c<=mini)
{
mini=S[j].c;
jj=j;
}
cost+=S[jj].c;
}
g<<cost;
f.close();
g.close();
return 0;
}