#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e18 + 7;
const int inf = (int)1e9 + 7;
const double eps = 1e-7;
const double pi = 3.14159265359;
int n, x, y, a[300000], cnt_segm;
bool meet_0;
int main() {
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 0; i < n; ++i) scanf("%1d", &a[i]);
  for (int i = 0; i < n; ++i) {
    if (a[i] == 1) {
      if (meet_0) ++cnt_segm;
      meet_0 = false;
    } else
      meet_0 = true;
  }
  if (meet_0) ++cnt_segm;
  if (cnt_segm == 0)
    printf("0");
  else if (x < y)
    printf("%lld", (long long)(cnt_segm - 1) * x + y);
  else
    printf("%lld", (long long)cnt_segm * y);
  return 0;
}
