{"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\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":"MD","content":"你有两个长度为 $n$ 的数列 $a$ 和 $b$。\n\n现在我们定义,若存在 $i$ 和 $j$,满足: $i \u003c j$ 且 $(a[i]+a[j]\u003eb[i]+b[j])$,则我们称数对 $(i, j)$ 为特殊数对\n\n你的目标是统计有多少个这样的数对。"}},{"title":"Input","value":{"format":"MD","content":"第一行输入 $n$,满足:$2 \\leq n \\leq 2 \\times 10^5$\n\n第二行输入 $a$ 数列,满足:$1 \\leq a[i] \\leq 10^9$\n\n第二行输入 $b$ 数列,满足:$1 \\leq b[i] \\leq 10^9$"}},{"title":"Output","value":{"format":"MD","content":"一行,输出特殊数对的个数"}},{"title":"Examples","value":{"format":"MD","content":"Input \n\n5\n5 9 3 7 3\n5 6 5 3 4\n\nOutput\n7"}}]}