#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
long long n, x, y;
string s;
long long mincost = 0;
long long blocks = 0;
int main() {
  cin >> n >> x >> y;
  scanf("\n");
  cin >> s;
  s.push_back('1');
  for (long long i = 1; i < s.size(); i++) {
    if (s[i - 1] == '0' && s[i] == '1') blocks++;
  }
  cout << min(min(x, y) * max(0LL, (blocks - 1)) + (blocks == 0 ? 0 : y),
              blocks * y);
  return 0;
}
