Cod sursa(job #2563924)
Utilizator | Gafton Ioan Alecsandru gafton_ioan | Data | 1 martie 2020 16:12:31 |
---|---|---|---|
Problema | Shop | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("shop.in");
ofstream out("shop.out");
short n,c,a[31],a1[31];
int b[31],nr[31];
long long l;
int main()
{
int i,j;
in>>n>>c>>l;
for(i=1;i<=n;++i)
{
in>>a[i]>>b[i];
a[i]=pow(c,a[i]);
a1[i]=i;
}
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j)
{
if(a[i]<a[j])
{
swap(a[i],a[j]);
swap(b[i],b[j]);
swap(a1[i],a1[j]);
}
}
i=1;
while(l)
{
while(a[i]<=l&&b[i])
{
l-=a[i];
--b[i];
nr[i]++;
}
++i;
}
for(i=1;i<=n;++i)
out<<nr[a1[i]]<<" ";
return 0;
}