Pagini recente » Cod sursa (job #2728845) | Cod sursa (job #1464085) | Cod sursa (job #2928464) | Cod sursa (job #1188121) | Cod sursa (job #39716)
Cod sursa(job #39716)
#include<fstream.h>
int k,n,c1,m,j,m1,aux1,c[1000];
long s,a[1000],b[1000],aux,contor[2100];
int main()
{
int i;
ifstream f("shop.in");
ofstream g("shop.out");
f>>n;
f>>m;
f>>s;
for(i=1;i<=n;i++)
{
f>>a[i];
f>>b[i];
c[i]=i;
}
for(i=1;i<n;i++)
for(j=i;j<=n;j++)
{
if(a[i]<a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
aux=b[i];
b[i]=b[j];
b[j]=aux;
aux1=c[i];
c[i]=c[j];
c[j]=aux1;
}
}
m1=m;
for(i=1;i<=n;i++)
{
c1=0;
m=1;
for(k=1;k<=a[i];k++)
m=m*m1;
while(s-m>0 && b[i]>0)
{
s=s-m;
c1++;
if(s-m==0)
c1++;
b[i]--;
}
contor[c[i]]=c1;
}
s=0;
for(i=1;i<=n;i++)
s+=contor[i];
g<<s<<endl;
for(i=1;i<=n;i++)
g<<contor[i]<<" ";
f.close();
g.close();
return 0;
}