#include <bits/stdc++.h>
using namespace std;
const int MAXN = 345678;
char s[MAXN];
int main() {
  int n, x, y;
  scanf("%d %d %d", &n, &x, &y);
  scanf("%s", s);
  int cur = 0, cnt0 = 0;
  while (cur < n) {
    while (cur < n && s[cur] == '1') cur++;
    if (cur < n || (s[n - 1] != '1')) cnt0++;
    while (cur < n && s[cur] == '0') cur++;
  }
  int cnt1 = 0;
  if (cnt0) cnt1 = cnt0 - 1;
  long long ans = cnt0 * (long long)y;
  printf("%lld\n", min(ans, (long long)y + (long long)x * cnt1));
  return 0;
}
