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

    • Server requests

    There are n requests to a server that we’re anticipating. Each of those requests will happen at some time and will take (duration) seconds to execute.
    We would like to know what is the maximum number of concurrent requests that the server should be able to handle.

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ ).
    The next n lines contain pairs of and integers (1 ≤ ≤ ).

    Output

    The program should print a single integer - the maximum number of concurrent requests the server needs to be able to handle.

    Examples

    Input
    Output
    5 1 2 1 4 2 2 3 1 2 1
    4

    Explanation

    1
    1
    ㅤ
    ㅤ
    2
    2
    2
    2
    ㅤ
    3
    3
    ㅤ
    ㅤ
    ㅤ
    4
    ㅤ
    ㅤ
    5
    ㅤ
    ㅤ
    Each number represents the request number. The cells marked with that number are the execution of that request on the server.
     

    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