{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eLong Long wanna buy a new computer. Long Long thought he was a master, so he decided to buy accessories and assemble his own computer. But actually Long Long is a rookie, so he only cares about the price and service life of accessories. There are $$$N$$$ kinds of accessory and $$$M$$$ accessories for each kind. To assemble a computer, you need all the kinds of accessory and each kind only need one. When any one of the accessories reaches the service life, the computer is damaged. Long Long defines the price pre unite time of his computer is the total price he spent divided by the life of the computer. Now we will give you all the accessories, and you need to assemble a computer that the price pre unite time is the lowest.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains two integers $$$N,M(1\\leq N,M \\leq 1000)$$$ , which means the number of accessory kinds and the accessories number in each kind. The next $$$N$$$ line(s) contain $$$2 \\times M$$$ numbers, $$$S_1,P_1,S_2,P_2...S_M,P_M (1 \\leq S_i \\leq S_i+1 \\leq 1000,1 \\leq P_i \\leq 1000000)$$$ , $$$S_i$$$ means the i-th accessory service time, and $$$P_i$$$ means the price. \u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003ePlease print only one number, which means the total price of your computer. If there is more than one combination make the price pre unite time is lowest, print the minimum total price.\u003c/p\u003e"}},{"title":"Examples","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 3\n1 2 2 2 3 5\n3 5 6 2 7 8\n2 4 3 4 3 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e11\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}