{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"livecodebench","formal_name":"LiveCodeBench","introduction":"競技プログラミングの新しい問題を継続的に収集し、コードに関する能力を評価するベンチマークです。初期release_v1は400問で、問題の出題元と公開日時、データセットの版を区別して扱います。\n\nLiveCodeBench continuously collects new competitive-programming problems to evaluate coding capabilities. Its initial release_v1 contains 400 problems, with source platform, contest date, and dataset version tracked explicitly.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://livecodebench.github.io/","indexing_mode":"noindex"},"task_id":"00811aa0-4b6a-5eda-9e24-f643b1b96cf9","task_key":"release~5fv1--test--2845","task_revision_id":"1","upstream_id":"2845","short_description":"find-the-value-of-the-partition","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-06-18T00:00:00\",\"contest_id\":\"weekly-contest-350\",\"difficulty\":\"medium\",\"platform\":\"leetcode\",\"question_content\":\"You are given a positive integer array nums.\\nPartition nums into two arrays, nums1 and nums2, such that:\\n\\nEach element of the array nums belongs to either the array nums1 or the array nums2.\\nBoth arrays are non-empty.\\nThe value of the partition is minimized.\\n\\nThe value of the partition is |max(nums1) - min(nums2)|.\\nHere, max(nums1) denotes the maximum element of the array nums1, and min(nums2) denotes the minimum element of the array nums2.\\nReturn the integer denoting the value of such partition.\\n \\nExample 1:\\n\\nInput: nums = [1,3,2,4]\\nOutput: 1\\nExplanation: We can partition the array nums into nums1 = [1,2] and nums2 = [3,4].\\n- The maximum element of the array nums1 is equal to 2.\\n- The minimum element of the array nums2 is equal to 3.\\nThe value of the partition is |2 - 3| = 1. \\nIt can be proven that 1 is the minimum value out of all partitions.\\n\\nExample 2:\\n\\nInput: nums = [100,1,10]\\nOutput: 9\\nExplanation: We can partition the array nums into nums1 = [10] and nums2 = [100,1].\\n- The maximum element of the array nums1 is equal to 10.\\n- The minimum element of the array nums2 is equal to 1.\\nThe value of the partition is |10 - 1| = 9.\\nIt can be proven that 9 is the minimum value out of all partitions.\\n\\n \\nConstraints:\\n\\n2 <= nums.length <= 10^5\\n1 <= nums[i] <= 10^9\",\"question_title\":\"find-the-value-of-the-partition\",\"starter_code\":\"class Solution:\\n    def findValueOfPartition(self, nums: List[int]) -> int:\\n        \"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://livecodebench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}