tmp.push_back(max_score[i]);
}
std::sort(tmp.begin(), tmp.end());
- qualify_beat_worst_case = tmp[tmp.size() - group.num_qualifying];
+ if (tmp.size() > group.num_qualifying) {
+ qualify_beat_worst_case = tmp[tmp.size() - group.num_qualifying];
+ } else {
+ qualify_beat_worst_case = 0;
+ }
std::vector<unsigned> tmp2;
for (unsigned i = 0; i < group.players.size(); ++i) {
}
std::sort(tmp2.begin(), tmp2.end());
- qualify_beat_best_case = tmp2[tmp2.size() - group.num_qualifying];
+ if (tmp2.size() > group.num_qualifying) {
+ qualify_beat_best_case = tmp2[tmp2.size() - group.num_qualifying];
+ } else {
+ qualify_beat_best_case = 0;
+ }
}
// print out the lines we can attain