Cod sursa(job #3210997)
| Utilizator | Data | 7 martie 2024 22:18:47 | |
|---|---|---|---|
| Problema | Branza | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
#define NMAX 100000
#define ll long long
#define MOD 666013
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
int n,s,t;
int a[NMAX+1];
int c[NMAX+1],p[NMAX+1];
int main()
{
fin >> n >> s >> t;
for(int i=1;i<=n;i++)
{
fin >> c[i] >> p[i];
}
a[1]=c[1]*p[1];
for(int i=2;i<=n;i++)
{
a[i]=p[i]*c[i];
for(int j=i-1;j>=max(1,j-t);j--)
{
a[i]=min(a[i],s*(i-j)*p[i] + p[i]*c[j]);
}
}
long long res=0;
for(int i=1;i<=n;i++)
{
res += a[i];
}
fout << res;
}
