102 ecological bin.cpp

UVA solutions to few selected problems

#include<iostream>
using namespace std;
int main()
{
    int b1,g1,c1,b2,g2,c2,b3,g3,c3;
    int a,b,c,d,e,f,min;
    while(cin>>b1>>g1>>c1>>b2>>g2>>c2>>b3>>g3>>c3)
    {
       min=0;                                           
       a=b2+b3+c1+c3+g1+g2;
       b=g2+g3+b1+b3+c1+c2;
       c=c2+c3+g1+g3+b1+b2;
       d=b2+b3+g1+g3+c1+c2;
       e=g2+g3+c1+c3+b1+b2;
       f=c2+c3+b1+b3+g1+g2;
       min=a;
       if(b<min)
       min=b;
       if(c<min)
       min=c;
       if(d<min)
       min=d;
       if(e<min)
       min=e;
       if(f<min)
       min=f;
       if(min==a)
       {
       cout<<"BCG"<<" "<<min<<endl;
       continue;
       }
       if(min==d)
       {
       cout<<"BGC"<<" "<<min<<endl;
       continue;
       }
       if(min==f)
       {
       cout<<"CBG"<<" "<<min<<endl;
       continue;
       }
       if(min==c)
       {
       cout<<"CGB"<<" "<<min<<endl;
       continue;
       }
       if(min==b)
       {
       cout<<"GBC"<<" "<<min<<endl;
       continue;
       }
       if(min==e)
       {
       cout<<"GCB"<<" "<<min<<endl;
       continue;
       }  
       }     
 system("pause");
}