Pagini recente » Cod sursa (job #2964408) | Cod sursa (job #887840) | Cod sursa (job #1666557) | Cod sursa (job #480946) | Cod sursa (job #1459216)
#include <cstdio>
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <climits>
#include <list>
#include <iomanip>
#include <cstdlib>
#include <map>
using namespace std;
int main() {
freopen("shop.in", "r", stdin);
freopen("shop.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, c;
long long l;
cin >> n >> c >> l;
int b[50];
map<int, int> oa;
for (int i = 0; i < n; i++) {
int a;
cin >> a >> b[i];
oa.insert(pair<int, int>(a, i));
}
int ord[50], total = 0;
for (map<int, int>::reverse_iterator rit = oa.rbegin(); rit != oa.rend(); rit++) {
int put = rit->first, poz = rit->second;
long long p = 1;
for (int i = 0; i < put; i++) {
p *= c;
}
long long maxim = l / p;
int ans = (maxim < b[poz]) ? maxim : b[poz];
ord[poz] = ans;
l -= ans * p;
total += ans;
}
cout << total << "\n";
for (int i = 0; i < n; i++) {
cout << ord[i] << " ";
}
return 0;
}