Pagini recente » Cod sursa (job #2820841) | Cod sursa (job #1468397) | Cod sursa (job #678136) | Cod sursa (job #468629) | Cod sursa (job #2495894)
#include <bits/stdc++.h>
using namespace std;
ifstream in("shop.in");
ofstream out("shop.out");
long long n,c,l,x,pz,ans[50],sol;
struct bani
{
long long val,nr,poz;
}v[50];
bool cmp(bani a,bani b)
{
return a.val>b.val;
}
bool cmp1(bani a,bani b)
{
return a.poz<b.poz;
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
in>>n>>c>>l;
for(int i=1;i<=n;i++)
{
in>>x>>v[i].nr;
v[i].poz=i;
long long p=1;
for(int j=1;j<=x;j++) p=p*c;
v[i].val=p;
}
sort(v+1,v+n+1,cmp);
pz=1;
while(l>0)
{
x=l/v[pz].val;
x=min(x,v[pz].nr);
l-=x*v[pz].val;
sol+=x;
ans[v[pz].poz]=x;
pz++;
}
out<<sol<<'\n';
for(int i=1;i<=n;i++) out<<ans[i]<<" ";
return 0;
}