Pagini recente » Cod sursa (job #2223592) | Cod sursa (job #51818) | Cod sursa (job #343528) | Cod sursa (job #1040308) | Cod sursa (job #1804328)
#include <cstdio>
#include <iostream>
using namespace std;
const int nmx = 100002;
int n,s,t;
long long c[nmx],p[nmx];
long long dp[nmx];
void citire()
{
scanf("%d %d %d", &n, &s, &t);
for(int i = 1; i <= n; ++i)
scanf("%lld %lld", &c[i], &p[i]);
}
void dinamica()
{
for(int i = 1; i <= n; ++i)
{
dp[i] = dp[i-1] + c[i] * p[i];
for(int j = i - 1; j >= 1 && j >= i - t; --j)
dp[i] = min(dp[i],dp[i-1] + c[j] * p[i] + s * (i - j) * p[i]);
}
}
void afish()
{
printf("%d\n", dp[n]);
}
int main()
{
freopen("branza.in", "r", stdin);
freopen("branza.out", "w", stdout);
citire();
dinamica();
afish();
return 0;
}