Algorithmen_Datenstrukturen/Uebung 5/Uebung5_3/main.cpp

15 lines
638 B
C++

#include "backpack.h"
#include "item.h"
#include <vector>
int main() {
std::vector<Item> items = {// creation of the availableItems
{"1", 5, 8}, {"2", 5, 8}, {"3", 6, 6},
{"4", 8, 5}, {"5", 10, 10}, {"6", 11, 5},
{"7", 12, 10}, {"8", 15, 17}, {"9", 15, 20},
{"10", 30, 20}};
Backpack bp((float)24,
items); // creation of the backpack, utilizing the constructor
bp.greedyPack(false); // greedily pack Backpack non-continuously
bp.greedyPack(true); // greedily pack Backpack continuously
}