n, x, y = map(int, input().split())
s = input().strip()
zero = 0
if s.count('0') == 0:
print(0)
exit()
cnt = sum([1 for x in s.split('1') if len(x)>0])
print((cnt-1)*min(x, y) + y)#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n,x,y;
cin>>n>>x>>y;
string s;
cin>>s;
ll p=0;
for(int i=1;i<n;i++)
{
if(s[i]=='1' && s[i-1]=='0') p++;
} // 110010111001000011
if(s[n-1]=='0') p++;
if(p==0)
{
cout<<0<<endl;
return 0;
}
cout<<min(p*y,(p-1)*x+y)<<endl;
return 0;
}34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |