Cod sursa(job #2625358)
| Utilizator | Data | 5 iunie 2020 21:51:42 | |
|---|---|---|---|
| Problema | Branza | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
long long int n,t,s,i,c[100001],p[100001],cm[100001],j,cost,sol;
int main()
{
f>>n>>s>>t;
for(i=1;i<=n;i++)
{ f>>c[i]>>p[i];
cm[i]=c[i];
}
for(i=1;i<=n;i++)
{ cost=(c[i]<cm[i])?c[i]:cm[i];
sol=sol+cm[i]*p[i];
for(j=1;j<=t;j++)
{ if((j+i)>n)break;
if(c[i+j]<(c[i]+j*s))break;
if(cm[i+j]>(c[i]+j*s))cm[j+i]=c[i]+j*s;
}
}
g<<sol;
return 0;
}
