시나브로

#include int tree[1000000]; int tree_amount = 0; int want_to_tree_amount = 0; int available(int mid) { long long buffer = 0; for (int i =tree_amount-1; i >0; i--) { if (tree[i] > mid) { buffer += tree[i] - mid; } if (tree[i] = want_to_tree_amount) return 1; return 0; } void quickSort(int first, int last) { int pivot; int i; int j; int temp; if (first < last) { pivot =..