102 - Ecological Bin Packing || UVa Online Judge
Problem name: 102 - Ecological Bin Packing
Judge: UVa Online Judge
Problem link: 102 - Ecological Bin Packing
Solution on GitHub: 102 - Ecological Bin Packing
[At first you should try to solve the problem on your own. This will increase your thinking power and the ability to solve the program will increase. And if you copy directly from here, you will not learn anything. So my advice is to try to solve it yourself first. If not then check this code. Once you understand the code, do it yourself. Don't copy from here.
Best of luck]
Solution in C++/Cpp
#include <iostream>
#define TLE ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
TLE
int n = 9, bottles[n], sum[6];
while (scanf("%d %d %d %d %d %d %d %d %d", &bottles[0], &bottles[1], &bottles[2], &bottles[3], &bottles[4], &bottles[5], &bottles[6], &bottles[7], &bottles[8]) != EOF)
{
for (int i = 0; i < 6; i++)
{
sum[i] = 0;
}
for (int i = 0; i < 9; i++)
{
if (i == 0 || i == 5 || i == 7)
{
continue;
}
else
{
sum[0] = sum[0] + bottles[i];
}
}
for (int i = 0; i < 9; i++)
{
if (i == 0 || i == 4 || i == 8)
{
continue;
}
else
{
sum[1] = sum[1] + bottles[i];
}
}
for (int i = 0; i < 9; i++)
{
if (i == 2 || i == 3 || i == 7)
{
continue;
}
else
{
sum[2] = sum[2] + bottles[i];
}
}
for (int i = 0; i < 9; i++)
{
if (i == 2 || i == 4 || i == 6)
{
continue;
}
else
{
sum[3] = sum[3] + bottles[i];
}
}
for (int i = 0; i < 9; i++)
{
if (i == 1 || i == 3 || i == 8)
{
continue;
}
else
{
sum[4] = sum[4] + bottles[i];
}
}
for (int i = 0; i < 9; i++)
{
if (i == 1 || i == 5 || i == 6)
{
continue;
}
else
{
sum[5] = sum[5] + bottles[i];
}
}
int min = sum[0], x = 0;
for (int i = 0; i < 6; i++)
{
if (sum[i] < min)
{
min = sum[i];
x = i;
}
}
string s[6] = {"BCG", "BGC", "CBG", "CGB", "GBC", "GCB"};
cout << s[x] << " " << min << endl;
}
return 0;
}
- Follow me on Facebook: Dabananda Mitra
- Follow me on Instagram: Dabananda Mitra
- Follow me on Twitter: Dabananda Mitra
- Lookup me on LinkedIn: Dabananda Mitra
- GitHub: Dabananda Mitra
