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

    • Divide the weights

    Given n weights , you are asked to split those weights into 2 groups so that the difference between those weights is minimal.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ 20).
    The next line contains n space-separated integers (1 ≤ ≤ ).

    Output

    The program should print the minimal possible difference between the two groups.

    Examples

    Input
    Output
    3 3 2 1
    0
    5 1 2 3 4 7
    1

    Explanation

    1. First group → 3, second group → 1 + 2 = 3
    1. First group → 1 + 7 = 8, second group → 2 + 3 + 4 = 9
     
    Hint
    You can try to split the weights in all the possible ways and calculate the minimum possible difference.

    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