Pagini recente » Cod sursa (job #1465703) | Cod sursa (job #2726084) | Cod sursa (job #3176574) | Cod sursa (job #1172570) | Cod sursa (job #1242421)
#include <fstream>
#include <cmath>
#include <iostream>
using namespace std;
ifstream f("shop.in");
ofstream g("shop.out");
long long n,c,l;
long long val[31];
long long rez[31];
int poz[31];
inline long long putere(int x)
{
long long t = c;
if (x == 0) return 1;
for (int i=1;i<x;i++)
t *= c;
return t;
}
inline long long min(long long a,long long b)
{
if (a < b) return a;
return b;
}
int main()
{
f >> n >> c >> l ;
for (int i=1;i<=n;i++)
{
long long a,b;
f >> a >> b;
val[a] +=b;
poz[i] = a;
}
int i = 30;
long long mon = 0;
while (l && (i >=0))
{
if (val[i])
{
long long temp,put;
put = putere(i);
temp = min ( val[i] , l / put);
mon += temp;
l -= (long long)(put * temp);
rez[i] += temp;
}
i--;
}
if (l > 0) return 100;
g << mon << "\n";
for (int i=1;i<=n;i++)
g << rez[ poz[i] ] << " ";
return 0;
}