Pagini recente » Cod sursa (job #1809908) | Cod sursa (job #1342172) | Cod sursa (job #521100) | Cod sursa (job #2660491) | Cod sursa (job #1806534)
#include <fstream>
using namespace std;
long long L, p, a[102], b[102];
int n, c, poz[102];
int main()
{
int i,j,k;
ifstream fin("shop.in");
ofstream fout("shop.out");
fin >> n >> c >> L;
for(i = 1; i <= n; ++i)
{
fin >> j >> k;
a[j] = k;
poz[i] = j;
}
k = 0;
while(L > 0)
{
b[k++] = L % c;
L /= c;
}
for(i = 60; i > 0; --i)
{
if(b[i] > a[i])
{
b[i - 1] += 1LL * (b[i] - a[i]) * c;
b[i] = a[i];
}
p += b[i];
}
p += b[0];
fout << p << "\n";
for(i = 1; i <= n; ++i)
fout << b[poz[i]] << " ";
fout << "\n";
fout.close();
return 0;
}