Go: package main

import "fmt"

const MAX = 1001

func main() {
	var n int
	fmt.Scanln(&n)
	a := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Scan(&a[i])
	}
	w := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Scan(&w[i])
	}
	l := MAX
	r := MAX
	for i := 0; i < n; i++ {
		if a[i] == 0 {
			if w[i] < r {
				r = w[i]
			}
		} else {
			if w[i] < l {
				l = w[i]
			}
		}
	}
	ans := 0
	if l < MAX && r < MAX {
		ans = l + r
	}
	fmt.Println(ans)
}

C++: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;


int N;
vector<int> A,B;
int which[10],value[10];


int main(){

	int num_0 = 0,num_1 = 0;

	scanf("%d",&N);

	for(int i = 0; i < N; i++){

		scanf("%d",&which[i]);

		if(which[i] == 0){

			num_0++;
		}else{

			num_1++;
		}
	}

	if(num_0 == 0 || num_1 == 0){

		printf("0\n");
		return 0;
	}

	for(int i = 0; i < N; i++){

		scanf("%d",&value[i]);

		if(which[i] == 0){

			A.push_back(value[i]);

		}else{

			B.push_back(value[i]);
		}
	}

	sort(A.begin(),A.end());
	sort(B.begin(),B.end());

	printf("%d\n",A[0]+B[0]);

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<int, ll> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=k ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
class Timer {
private:
    string scope_name;
    chrono::high_resolution_clock::time_point start_time;
public:
    Timer (string name) : scope_name(name) {
        start_time = chrono::high_resolution_clock::now();
    }
    ~Timer () {
        auto stop_time = chrono::high_resolution_clock::now();
        auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
        double mlength = double(length) * 0.001;
        debug(scope_name, mlength);
    }
};
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif

const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 11;

int n;
bool lf[MAXN];
int w[MAXN];
/********** Good Luck :) **********/
int main () {
    TIME(main);
    IOS();

    cin >> n;
    REP (i, n) {
        cin >> lf[i];
    }
    REP (i, n) {
        cin >> w[i];
    }

    vector<int> idx;
    REP (i, n) {
        idx.eb(i);
    }

    int ans = iNF;
    do {
        int cur = 0;
        REP (i, n) {
            if (lf[idx[i]]) {
                if (!lf[idx[(i+n-1)%n]]) {
                    cur += w[idx[(i+n-1)%n]];
                }
            } else {
                if (lf[idx[(i+1)%n]]) {
                    cur += w[idx[(i+1)%n]];
                }
            }
        }
        ans = min(ans, cur);
    } while (next_permutation(ALL(idx)));

    cout << ans << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef pair<int,int>P;
int main(void){
	int n;
	P pp[11];
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>pp[i].F;
	}
	for(int i=0;i<n;i++){
		cin>>pp[i].S;
	}
	int MIN0=INT_MAX;
	int MIN1=INT_MAX;
	bool flg=false;
	bool flg1=false;
	for(int i=0;i<n;i++){
		if(pp[i].F==1){
			MIN1=min(MIN1,pp[i].S);
			flg1=true;
		}
		if(pp[i].F==0){
			MIN0=min(MIN0,pp[i].S);
			flg=true;
		}
	}
	if(flg&&flg1){
		cout<<MIN1+MIN0<<endl;
	}
	else{
		cout<<0<<endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,a[10],b[10],cl=0,cr=0,minl=1000,minr=1000;
  cin>>n;
  for(int i=0;i<n;++i){
    cin>>a[i];
    if(a[i]) ++cl;
    else ++cr;
  }
  for(int i=0;i<n;++i) cin>>b[i];
  if(cl==0||cr==0) cout<<"0"<<endl;
  else{
    for(int i=0;i<n;++i){
      if(a[i]) minr=min(minr,b[i]);
      else minl=min(minl,b[i]);
    }
    cout<<minl+minr<<endl;
  }
  return 0;
}