#include <bits/stdc++.h>
using namespace std;
int n, x, y;
const int MAXN = 300100;
char s[MAXN];
void load() {
  scanf("%d%d%d", &n, &x, &y);
  scanf("%s", s);
}
void solve() {
  int cnt = 0;
  int ind = 0;
  while (ind < n) {
    while (ind < n && s[ind] == '1') ind++;
    if (ind == n) break;
    while (ind < n && s[ind] == '0') ind++;
    cnt++;
  }
  long long z = min(x, y);
  long long ret = 0;
  if (cnt > 1) ret += z * (cnt - 1);
  if (cnt) ret += y;
  printf("%lld\n", ret);
}
int main() {
  load();
  solve();
  return 0;
}
