Minimum Subarray Sum

locked

You are given an array of integers of size n . Find a subarray whose sum of elements is as minimum as possible . Print the sum of elements of that subarray.

Note : A subarray is consisted of some consecutive elements of an array . For example, if we consider an array {1,3,22,8} , then {1,3} or {3,22,8} will be subarray of this array , but {1,8} or {1,22,8} won't be .

Input Format

First line of the input contains an integer n , which is the size of the array . Second line of input contains n space seperated integers a1,a2,.....,an

Constraints

1<=n<=100,000

0<=ai<=1,000,000,000

Output Format

Print the answer in one line.

Sample Input 0

1
1

Sample Output 0

1

Sample Input 1

3
0 0 0

Sample Output 1

0
Line: 1 Col: 1
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score