{"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\"\u003eThe title of this problem is familiar,isn\u0027t it?yeah,if you had took part in the \"Rookie Cup\" competition,you must have seem this title.If you haven\u0027t seen it before,it doesn\u0027t matter,I will give you a link:\u003cbr\u003e\u003cbr\u003eHere is the link:\u003ca href\u003d\"http://acm.hdu.edu.cn/showproblem.php?pid\u003d2602\"\u003ehttp://acm.hdu.edu.cn/showproblem.php?pid\u003d2602\u003c/a\u003e\u003cbr\u003e\u003cbr\u003eToday we are not desiring the maximum value of bones,but the K-th maximum value of the bones.NOTICE that,we considerate two ways that get the same value of bones are the same.That means,it will be a strictly decreasing sequence from the 1st maximum , 2nd maximum .. to the K-th maximum.\u003cbr\u003e\u003cbr\u003eIf the total number of different values is less than K,just ouput 0.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contain a integer T , the number of cases.\u003cbr\u003eFollowed by T cases , each case three lines , the first line contain two integer N , V, K(N \u0026lt;\u003d 100 , V \u0026lt;\u003d 1000 , K \u0026lt;\u003d 30)representing the number of bones and the volume of his bag and the K we need. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"One integer per line representing the K-th maximum of the total value (this number will be less than 2\u003csup\u003e31\u003c/sup\u003e).\u003cbr\u003e "}},{"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\r\n5 10 2\r\n1 2 3 4 5\r\n5 4 3 2 1\r\n5 10 12\r\n1 2 3 4 5\r\n5 4 3 2 1\r\n5 10 16\r\n1 2 3 4 5\r\n5 4 3 2 1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e12\r\n2\r\n0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}