{"problem":{"name":"F. Rect","description":{"content":"Given  points on a plane, output the area of a rectangle with its sides parallel with the coordinate axes that contains inside or on the sides at least  points of the  points given. The input file *d","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":4096},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10100F"},"statements":[{"statement_type":"Markdown","content":"Given  points on a plane, output the area of a rectangle with its sides parallel with the coordinate axes that contains inside or on the sides at least  points of the  points given.\n\nThe input file *drept.in* contains on the first lines 2 numbers  and each of the following  lines contains 2 numbers  and   describing the th point. \n\nThe output file *drept.out* contains the required area.\n\n## Input\n\nThe input file *drept.in* contains on the first lines 2 numbers  and each of the following  lines contains 2 numbers  and   describing the th point. \n\n## Output\n\nThe output file *drept.out* contains the required area.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of points.  \nLet $ P = \\{(x_i, y_i) \\mid i \\in \\{1, \\dots, n\\}\\} $ be a set of points in $ \\mathbb{R}^2 $.\n\n**Constraints**  \nEach point satisfies $ x_i, y_i \\in \\mathbb{R} $.\n\n**Objective**  \nFind the minimum area $ A $ of an axis-aligned rectangle $ R = [x_{\\min}, x_{\\max}] \\times [y_{\\min}, y_{\\max}] $ such that all $ n $ points lie inside or on the boundary of $ R $:  \n$$\nA = (x_{\\max} - x_{\\min}) \\cdot (y_{\\max} - y_{\\min})\n$$  \nwhere  \n$$\nx_{\\min} = \\min_{i} x_i, \\quad x_{\\max} = \\max_{i} x_i, \\quad y_{\\min} = \\min_{i} y_i, \\quad y_{\\max} = \\max_{i} y_i\n$$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10100F","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}