#include <bits/stdc++.h>
using namespace std;
long long int sumofd(long long int a) {
  long long int c = 0;
  while (a != 0) {
    c += a % 10;
    a = a / 10;
  }
  return c;
}
long long int alleq(string s) {
  long long int f = 1;
  for (long long int i = 0; i < s.length(); i++) {
    if (s[i] != s[0]) {
      f = 0;
      break;
    }
  }
  return f;
}
long long int powermod(long long int a, long long int b) {
  a = a % 1000000007;
  if (b == 0) {
    return 1;
  }
  if (b % 2 == 0) {
    return powermod((a * a) % 1000000007, b / 2) % 1000000007;
  } else if (b % 2 == 1) {
    return a * powermod((a * a) % 1000000007, (b - 1) / 2) % 1000000007;
  }
}
long long int invmodulo(long long int a, long long int b) {
  return powermod(a, b);
}
bool sortbysec(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  return (a.second < b.second);
}
long long int power(long long int a, long long int b) {
  if (b == 0) {
    return 1;
  } else if (b % 2 == 0) {
    return power(a * a, b / 2);
  } else if (b % 2 == 1) {
    return a * power(a * a, (b - 1) / 2);
  }
}
void oblivious() {
  long long int n, x, y;
  cin >> n >> x >> y;
  string s;
  cin >> s;
  long long int i = 0;
  string s1 = "";
  while (i < n) {
    long long int f = 0;
    while (s[i] == '0' && i < n) {
      i++;
      f = 1;
    }
    if (f == 1) {
      s1.push_back('0');
    }
    f = 0;
    while (s[i] == '1' && i < n) {
      i++;
      f = 1;
    }
    if (f) {
      s1.push_back('1');
    }
  }
  long long int cnt = 0;
  for (long long int i = 0; i < s1.length(); i++) {
    if (s1[i] == '0') {
      cnt++;
    }
  }
  if (cnt == 0) {
    cout << "0" << '\n';
  } else {
    long long int z = (cnt - 1) * min(x, y) + y;
    cout << z << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    oblivious();
  }
  return 0;
}
