Pagini recente » Borderou de evaluare (job #2085113) | ofjaso20165 | Cod sursa (job #1690105) | Cod sursa (job #3210201) | Cod sursa (job #2500081)
#include <fstream>
using namespace std;
ifstream cin("branza.in");
ofstream cout("branza.out");
#define MAXN 100005
int n, s, t;
long long ans;
int p[MAXN];
int c[MAXN];
int main()
{
cin >> n >> s >> t;
int x, y;
for(int i = 0; i < n; i++)
{
cin >> p[i] >> c[i];
}
int i, j, sum = 0;
ans = 0;
for(i = 0; i < n; i++)
{
sum = 0;
if(p[i] * (c[i] + c[i+1]) + (s * c[i+1]) < (p[i] * c[i]) + (p[i+1] * c[i+1]))
{
sum += p[i] * (c[i] + c[i+1]) + (s * c[i+1]);
for(j = 2; j < t; j++)
{
if(sum + p[i] * c[i+j] + (s * c[i+j] * j) < sum + (p[i] * c[i]) + (p[i+j] * c[i+j]))
{
sum += p[i] * c[i+j] + (s * c[i+j] * j);
c[i+j] = 0;
}
else
break;
}
ans += sum;
i += j - 1;
}
else
{
ans += p[i] * c[i];
}
}
cout << ans;
return 0;
}