Dividing apples | 프로그래밍의 벗 PivotOJ
PivotOJ

Dividing apples

시간 제한: 1000ms메모리 제한: 1024MB출처: EIO 2019-20 openBOJ 29911

문제

NN baskets are lined up, numbered 1N1 \ldots N from left to right. The basket number ii contains KiK_i apples. John and Mary want to draw a line between two baskets, and then John would get all the baskets to the left of the line and Mary all the baskets to the right of the line. Help them draw the line to divide the apples as equally as possible!

입력

The first line of input contains NN, the number of baskets (2N10000002 \le N \le 1\,000\,000). Each of the following NN lines contains an integer KiK_i: the number of apples in basket number ii (1iN1 \le i \le N, 0Ki100000 \le K_i \le 10\,000).

출력

The only line of output should contain a single integer: the number of the basket to the right of which the line should be drawn, so that the absolute value of the difference between the number of apples John gets, and the number of apples Mary gets, would be as small as possible. If there are multiple possible answers, output any one of them.

예제

예제 1

입력
7
4
2
10
2
9
3
7
출력
4
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.