{"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\u003eThe Fair Nut got stacked in planar world. He should solve this task to get out.\u003c/p\u003e\u003cp\u003eYou are given $$$n$$$ rectangles with vertexes in $$$(0, 0)$$$, $$$(x_i, 0)$$$, $$$(x_i, y_i)$$$, $$$(0, y_i)$$$. For each rectangle, you are also given a number $$$a_i$$$. Choose some of them that the area of union minus sum of $$$a_i$$$ of the chosen ones is maximum.\u003c/p\u003e\u003cp\u003eIt is guaranteed that there are no nested rectangles.\u003c/p\u003e\u003cp\u003eNut has no idea how to find the answer, so he asked for your help.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains one integer $$$n$$$ ($$$1 \\leq n \\leq 10^6$$$)\u0026nbsp;— the number of rectangles.\u003c/p\u003e\u003cp\u003eEach of the next $$$n$$$ lines contains three integers $$$x_i$$$, $$$y_i$$$ and $$$a_i$$$ ($$$1 \\leq x_i, y_i \\leq 10^9$$$, $$$0 \\leq a_i \\leq x_i \\cdot y_i$$$).\u003c/p\u003e\u003cp\u003eIt is guaranteed that there are no nested rectangles.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eIn a single line print the answer to the problem\u0026nbsp;— the maximum value which you can achieve.\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\n4 4 8\n1 5 0\n5 2 10\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e9\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","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\u003e4\n6 2 4\n1 6 2\n2 4 3\n5 3 8\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e10\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first example, the right answer can be achieved by choosing the first and the second rectangles.\u003c/p\u003e\u003cp\u003eIn the second example, the right answer can also be achieved by choosing the first and the second rectangles.\u003c/p\u003e"}}]}