#include typedef long long ll; typedef unsigned long long ull; #define FOR(i,a,b) for(int (i)=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define RANGE(vec) (vec).begin(),(vec).end() using namespace std; class CardGameMedium { public: void solve(void) { int N; double Pa,Pb; cin>>N>>Pa>>Pb; vector A(N); vector B(N); REP(i,N) cin>>A[i]; REP(i,N) cin>>B[i]; double p = 0.0; int n = 0; std::mt19937 engine; uniform_real_distribution g(0,1); const int T = 200000; // O(T*N^2) REP(_,T) { int scoreA = 0; int scoreB = 0; auto a(A); auto b(B); REP(i,N) { int ia,ib; uniform_int_distribution f(0,a.size()-1); double u = g(engine); if ( u <= Pa ) ia = min_element(RANGE(a))-a.begin(); else ia = f(engine); if ( u <= Pb ) ib = min_element(RANGE(b))-b.begin(); else ib = f(engine); if (a[ia] > b[ib]) scoreA += a[ia]+b[ib]; else if (a[ia] < b[ib]) scoreB += a[ia]+b[ib]; a.erase(a.begin()+ia); b.erase(b.begin()+ib); } if (scoreA > scoreB) p += 1; ++n; } p /= n; cout<solve(); delete obj; return 0; } #endif