{"trustable":false,"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\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"给你一共长度为2*n的数组。问能不能分成两个长度为n的数组且他们没有相同元素。这两个数组还有一个重要的限制条件:有一个空数组,这两个数组可以通过每次将头元素较小的放入空数组中最后还原给出的2*n的数组。"}},{"title":"Input","value":{"format":"HTML","content":"第一行包含一个整数t(1\u003c\u003dt\u003c\u003d1000),是测试用例的数量。然后每个测试用例的第一行包含一个整数n(1\u003c\u003dn\u003c\u003d2000)。每个测试用例的第二行是2n个整数,表示给定的数组p。(1\u003c\u003dpi\u003c\u003d2n)。\n保证所有n的和不超过2000\n\n\n"}},{"title":"Output","value":{"format":"HTML","content":"输入“YES”,如果能完成题目要求。否则输出“NO”。"}},{"title":"Example","value":{"format":"HTML","content":"\u003cdiv class\u003d\"sample-test\"\u003e \n \u003cdiv class\u003d\"input\"\u003e \n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e \n \u003cpre\u003e6\n2\n2 3 1 4\n2\n3 1 2 4\n4\n3 2 6 1 5 7 8 4\n3\n1 2 3 4 5 6\n4\n6 1 3 7 4 5 8 2\n6\n4 3 2 5 1 11 9 12 8 6 10 7\n\u003c/pre\u003e\n \u003c/div\u003e \n \u003cdiv class\u003d\"output\"\u003e \n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e \n \u003cpre\u003eYES\nNO\nYES\nYES\nNO\nNO\n\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"HTML","content":"第一个例子:[2,3,1,4]可以分成(3,1)(2,4)。"}}]}