Pagini recente » Cod sursa (job #1239862) | Cod sursa (job #3243653) | Cod sursa (job #2352225) | Cod sursa (job #2847876) | Cod sursa (job #2702078)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("shop.in");
ofstream fout("shop.out");
unsigned int n, c, cnt, ans[35], indexx[35];
unsigned long long l, p[35];
int main(){
p[0] = 1;
for (int i = 1; i <= 32; ++i){
p[i] = 1LL * 2 * p[i - 1];
}
fin >> n >> c >> l;
vector <pair <int, int> > v(n);
for (int i = 0; i < n; ++i){
fin >> v[i].first >> v[i].second;
indexx[v[i].first] = i;
}
sort(v.begin(), v.end());
for (int i = n - 1; i >= 0; --i){
cnt += min(1LL * v[i].second, l / p[v[i].first]);
ans[indexx[v[i].first]] = min(1LL * v[i].second, l / p[v[i].first]);
l -= 1LL * min(1LL * v[i].second, l / p[v[i].first]) * p[v[i].first];
}
fout << cnt << "\n";
for (int i = 0; i < n; ++i){
fout << ans[i] << " ";
}
fin.close();
fout.close();
return 0;
}