Alice and Bob need to pick apples from in orchard. Alice can pick apples from exactly A numbers of trees, Bob can pick from exactly B trees (A, B are both integers). The orchard is a row of N trees, on each tree there is a different number of apples. Given integers A, B and an array size N containing integers only, return the number of most apples Alice and Bob can pick together where: - Alice most pick apples from trees left to Bob's trees - Alice's and Bob's trees cannot overlap, that is they cannot pick from the same tree If A + B > N you should return 0
