OJ Board

Thanks, I couldn't see the forest for the trees.

Seems straightforward enough, but I got WA.

[cpp]
#include <iostream>
#include <climits>

using namespace std;

int bin1g, bin1b, bin1c, bin2g, bin2b, bin2c, bin3g, bin3b, bin3c;
int one = 0;

void PackBottles()
{
int bcg, bgc, cbg, cgb, gbc, gcb;
int minSwap = INT_MAX;

bcg = bin2b + bin3b ...