```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 ``` ```#include #include #include #include #include std::vector Sort(std::vector weights, const double pounds) { std::sort(weights.begin(), weights.end()); std::vector::iterator iter = weights.end(); double total=0; while(total < pounds) { --iter; total += *iter; } return std::vector(iter, weights.end()); } std::vector Heap(std::vector weights, const double pounds) { std::make_heap(weights.begin(), weights.end()); std::vector result; double total=0; while(total < pounds) { std::pop_heap(weights.begin(), weights.end()); result.push_back(weights.back()); total += weights.back(); weights.pop_back(); } return result; } std::vector SoapBox(std::vector weights, const double pounds) { std::greater pred; std::vector result(1, weights[0]); double total=weights[0]; double lightest=weights[0]; unsigned int i; for(i=0; ilightest && total-lightest+curweight>=pounds) { do { std::pop_heap(result.begin(), result.end(), pred); total -= result.back(); result.pop_back(); lightest = result.front(); } while(total-lightest+curweight >= pounds); result.push_back(curweight); std::push_heap(result.begin(), result.end(), pred); total += curweight; if (curweight < lightest) curweight = lightest; } } return result; } struct PartitionPred { const double pounds; PartitionPred(const double lb) : pounds(lb) {} bool operator()(double lb) {return lb NeilG(std::vector weights, const double pounds) { std::vector::iterator spared = weights.begin(); std::vector::iterator dead = weights.end(); std::vector::iterator mid; std::vector::iterator i; double deadtotal = 0; while(dead > spared && *spared!=*(dead-1)) { ptrdiff_t count = std::distance(spared, dead); if (count > 5) count = 5; std::sort(spared, spared + count); double guess = spared[count/2]; mid = std::partition(spared, dead, PartitionPred(guess)); if (mid == spared) { for(i = spared+1; i guess) { mid = std::partition(spared, dead, PartitionPred(guess=*i)); break; } } } else if (mid == dead) { for(i = spared; i guess) { mid = std::partition(spared, dead, PartitionPred(guess=*i)); break; } } } double greaterweight=0; for(i=mid; i= pounds) { spared = mid; } else { deadtotal += greaterweight; dead = mid; } } while(deadtotalspared) { --dead; deadtotal += *dead; } return std::vector(dead, weights.end()); } #define COUNT 10000000 int main() { //srand(time_t(NULL)); //omitted for consistancy std::vector weights; weights.reserve(COUNT); std::vector result0, result1, result2, result3, result4; result1.reserve(20); result2.reserve(20); result3.reserve(20); result3.reserve(20); clock_t begin, end; double total; for(unsigned int i=0; i
 ```1 ``` ```Timeout ```