{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eLong long ago, there was an integer sequence a.\u003cbr\u003eTonyfang think this sequence is messy, so he will count the number of inversions in this sequence. Because he is angry, you will have to pay x yuan for every inversion in the sequence.\u003cbr\u003eYou don\u0027t want to pay too much, so you can try to play some tricks before he sees this sequence. You can pay y yuan to swap any two adjacent elements.\u003cbr\u003eWhat is the minimum amount of money you need to spend?\u003cbr\u003eThe definition of inversion in this problem is pair $(i,j)$ which $1 \\leq i \u0026lt; j \\leq n$ and $a_i \u0026gt; a_j$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"There are multiple test cases, please read till the end of input file.\u003cbr\u003eFor each test, in the first line, three integers, n,x,y, n represents the length of the sequence.\u003cbr\u003eIn the second line, n integers separated by spaces, representing the orginal sequence a.\u003cbr\u003e$1 \\leq n,x,y \\leq 100000$, numbers in the sequence are in $[-10^9,10^9]$. There\u0027re 10 test cases."}},{"title":"Output","value":{"format":"HTML","content":"For every test case, a single integer representing minimum money to pay."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 233 666\r\n1 2 3\r\n3 1 666\r\n3 2 1\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\r\n3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}