CPMagical CP Library

Problem solution · Python

ABC321 D — Set Menu

ABC321 D — Set Menu: a Python solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to KATO-Hiro AtCoder Solutions.

Technique
Sorting and greedy selection
Source
KATO-Hiro AtCoder Solutions
Length
76 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For ABC321 D — Set Menu, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 76 lines of Python from the credited upstream file abc321_d.py.
  • The implementation visibly relies on sequence storage, ordered lookup.
  • No explicit loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from KATO-Hiro AtCoder Solutions by KATO-Hiro and is used under the CC0-1.0 licence.

Open problem ↗Original source ↗
Full codeABC321 D — Set Menu · PythonPython
Use this to learn the idea, then write your own version.
# -*- coding: utf-8 -*-  from bisect import bisect_left, bisect_rightfrom typing import List  def bisect_lt(sorted_array: List[int], value: int):    """Find the largest element < x and its index, or None if it doesn't exist."""     if sorted_array[0] < value:        index: int = bisect_left(sorted_array, value) - 1         return index, sorted_array[index]     return None, None  def bisect_le(sorted_array: List[int], value: int):    """Find the largest element <= x and its index, or None if it doesn't exist."""     if sorted_array[0] <= value:        index: int = bisect_right(sorted_array, value) - 1         return index, sorted_array[index]     return None, None  def bisect_gt(sorted_array: List[int], value: int):    """Find the smallest element > x and its index, or None if it doesn't exist."""     if sorted_array[-1] > value:        index: int = bisect_right(sorted_array, value)         return index, sorted_array[index]     return None, None  def bisect_ge(sorted_array: List[int], value: int):    """Find the smallest element >= x and its index, or None if it doesn't exist."""     if sorted_array[-1] >= value:        index: int = bisect_left(sorted_array, value)         return index, sorted_array[index]     return None, None  def main():    import sys    from itertools import accumulate     input = sys.stdin.readline     n, m, p = map(int, input().split())    a = sorted(list(map(int, input().split())))    b = sorted(list(map(int, input().split())))    acc_b = list(accumulate([0] + b + [0]))    inf = 10**18    c = [-inf] + b + [inf]    ans = 0     for ai in a:        i, value = bisect_le(c, p - ai)  # the largest element <= x        ans += acc_b[i] + ai * i        ans += p * max(m - i, 0)     print(ans)  if __name__ == "__main__":    main()

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗