n = int(input())
str_1 = input()
l = list(map(lambda x : int(x),str_1.split()))
f = 0
s = 0
counter = 1
for i in range(n):
if counter % 2 == 1:
if l[0] > l[-1]:
f = f + l[0]
l.remove(l[0])
else:
f = f + l[-1]
l.remove(l[-1])
counter = counter + 1
else:
if l[0] > l[-1]:
s = s + l[0]
l.remove(l[0])
else:
s = s + l[-1]
l.remove(l[-1])
counter = counter + 1
print(f,s)/*
Name : Meharaz Hossain
BSc in CSE
Bangladesh University of Business and Technology
Dhaka, Bangladesh....
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, sereja = 0, dima = 0, i, j, s;
cin >> n;
int aa[n];
for (int i = 0; i < n; i++)
{
cin >> aa[i];
}
s = 0, j = n - 1;
for (i = 0; i < n; i++)
{
if (i % 2 == 0)
{
if (aa[s] > aa[j])
{
sereja = sereja + aa[s];
s++;
}
else
{
sereja = sereja + aa[j];
j--;
}
}
else
{
if (aa[s] > aa[j])
{
dima = dima + aa[s];
s++;
}
else
{
dima = dima + aa[j];
j--;
}
}
}
cout << sereja << " " << dima << endl;
return 0;
}102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |