解法:(暴力破解><)
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace CPE_3test
{
class _00102_Ecological_Bin_Packing
{
public static void Main(string[] args)
{
Console.WriteLine("請輸入資料來分組!");
int[] a = new int[3], b = new int[3], c = new int[3];
for (int intA = 0; intA < 2; intA++)
{
string[] stamp =(Console.ReadLine()).Split(' ');
a[0] = Convert.ToInt32(stamp[0]);
a[1] = Convert.ToInt32(stamp[1]);
a[2] = Convert.ToInt32(stamp[2]);
b[0] = Convert.ToInt32(stamp[3]);
b[1] = Convert.ToInt32(stamp[4]);
b[2] = Convert.ToInt32(stamp[5]);
c[0] = Convert.ToInt32(stamp[6]);
c[1] = Convert.ToInt32(stamp[7]);
c[2] = Convert.ToInt32(stamp[8]);
}
delievery(a, b, c);
}
private static void delievery(int[] b, int[] g, int[] c)
{
int min = BGC(b, g, c);
string msg = "BGC";
if (min > BCG(b, g, c)) { min = BCG(b, g, c); msg = "BCG"; }
if (min > GBC(b, g, c)) { min = GBC(b, g, c); msg = "GBC"; }
if (min > GCB(b, g, c)) { min = GCB(b, g, c); msg = "GCB"; }
if (min > CBG(b, g, c)) { min = CBG(b, g, c); msg = "CBG"; }
if (min > CGB(b, g, c)) { min = CGB(b, g, c); msg = "CGB"; }
Console.WriteLine(msg + " " + min);
}
private static int BGC(int[] b, int[] g, int[] c)
{
int sum = 0;
sum = g[0] + c[0];
sum += b[1] + c[1];
sum += b[2] + g[2];
return sum;
}
private static int BCG(int[] b, int[] g, int[] c)
{
int sum = 0;
sum = g[0] + c[0];
sum += b[1] + g[1];
sum += b[2] + c[2];
return sum;
}
private static int GBC(int[] b, int[] g, int[] c)
{
int sum = 0;
sum = g[1] + c[1];
sum += b[0] + c[0];
sum += b[2] + g[2];
return sum;
}
private static int GCB(int[] b, int[] g, int[] c)
{
int sum = 0;
sum = g[1] + c[1];
sum += b[2] + c[2];
sum += b[0] + g[0];
return sum;
}
private static int CBG(int[] b, int[] g, int[] c)
{
int sum = 0;
sum = g[2] + c[2];
sum += b[0] + c[0];
sum += b[1] + g[1];
return sum;
}
private static int CGB(int[] b, int[] g, int[] c)
{
int sum = 0;
sum = g[2] + c[2];
sum += b[1] + c[1];
sum += b[0] + g[0];
return sum;
}
}
}
