Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- class binpack {
- public:
- int n;
- int K;
- int items[];
- binpack(int Anzahl, int Schranke)
- {
- n=Anzahl;
- K=Schranke;
- int items[n];
- };
- };
- int firstfit (binpack b)
- {
- bool zugeteilt;
- vector<int> bins;
- for (int i=0; i<b.n; i++)
- {
- zugeteilt=false;
- for(int j=0; j<bins.size(); j++)
- {
- if( bins[j]+b.items[i] <= b.K)
- {
- bins[j]+=b.items[i];
- zugeteilt=true;
- break;
- }
- }
- if(!zugeteilt)
- {
- bins.push_back(b.items[i]);
- }
- }
- return bins.size();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement