#include <bits/stdc++.h>
using namespace std;
const int maxn = 300000 + 10;
vector<int> b;
int a[maxn];
int n, x, y;
int p;
long long res;
int main() {
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 1; i <= n; i++) scanf("%1d", &a[i]);
  a[n + 1] = 1;
  p = -1;
  for (int i = 1; i <= n + 1; i++) {
    if (a[i] == 1) {
      if (p != -1) {
        b.push_back(i - p);
        p = -1;
      }
    } else if (p == -1)
      p = i;
  }
  if (b.size() == 0)
    res = 0;
  else if (y <= x)
    res = (long long)y * b.size();
  else
    res = (long long)x * (long long)(b.size() - 1) + y;
  cout << res << '\n';
  return 0;
}
