Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

  • Match the dancers

    There are n men and k women with corresponding dancing skills and .
    You’d like to match them in pairs and to make sure both partners are satisfied, you’d like to keep the difference in skill levels for each pair at most 1.
    How many pairs would it be possible to have for the dancing competition?
     
    notion image

    Input

    The first line of the input contains two integers n and k (1 ≤ n, k ≤ ).
    The next line contains n space-separated integers (1 ≤ ≤ 100).
    The third line contains k space-separated integers (1 ≤ ≤ 100).

    Output

    The program should print the maximum number of pairs you can get by matching them.

    Examples

    Input
    Output
    4 5 2 4 6 3 5 1 5 7 10
    3
    4 4 1 2 3 4 51 52 53 54
    0
    5 3 2 2 2 2 2 2 3 4
    2

    Explanation

    1. Match → 2 ↔ 1, 4 ↔ 5, and 6 ↔ 5
    1. Not possible to match anyone
    1. Match → 2 ↔ 2, 2 ↔ 3

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue