Skip to content
QuantReadySign In
#363easyGreedy

Assign Orders to Desks

Part of:Algorithms & Data Structures → Greedy

Problem

There are n incoming orders, each with a certain size, and m trading desks, each with a capacity. A desk can process an order only if its capacity ≥ the order's size. Each desk handles at most one order.

Find the maximum number of orders that can be assigned to desks.

Input Format

  • First line: integers n and m.
  • Second line: n integers — order sizes.
  • Third line: m integers — desk capacities.

Output Format

A single integer — maximum orders assigned.

Examples

Example 1
Input(First line: integers n and m.)
3 3
1 3 5
2 4 6
Output
3

Order 1→Desk 2, Order 3→Desk 4, Order 5→Desk 6. All matched.

Example 2
Input(First line: integers n and m.)
3 2
2 4 6
3 5
Output
2

Order 2→Desk 3, Order 4→Desk 5. Order 6 can't be filled.

Constraints

  • •1 ≤ n, m ≤ 10^5
  • •1 ≤ order_size, desk_capacity ≤ 10^9

Execution limits: 2s · 256MB

Loading interactive editor…