#include <bits/stdc++.h>
using namespace std;
int n, x, y;
string s;
long long f[300005];
int main() {
  scanf("%d %d %d", &n, &x, &y);
  cin >> s;
  int ngroups = 0;
  for (int i = 0; i < n; i++)
    if (s[i] == '0' && (!i || s[i] != s[i - 1])) {
      ngroups++;
    }
  f[0] = 0;
  f[1] = y;
  for (int i = 2; i <= ngroups; i++) {
    f[i] = min(f[i - 1] + y, f[i - 1] + x);
  }
  printf("%lld\n", f[ngroups]);
  return 0;
}
