#include #include #include #include int max(std::list l, int plus, int minus){ l.sort(); // '+'の数+1個の項を作る if(l.size() != minus + plus + 1){ int num = 0; while(l.size() != minus + plus){ num = num * 10 + l.back(); l.pop_back(); } l.push_back(num); } while(minus){ int num = l.front(); l.pop_front(); int num2 = l.back(); l.pop_back(); l.push_back(num2 - num); minus--; } int ans = l.front(); l.pop_front(); while(!l.empty()) { ans += l.back(); l.pop_back(); } return ans; } int min(std::list l, int plus, int minus){ l.sort(); if(minus == 0){ std::vector v(plus + 1); // 計算には'+'+1個の項が必要 int n = 0; while(!l.empty()){ v[n] = v[n] * 10 + l.front(); l.pop_front(); n++; n %= plus + 1; } while(v.size() != 1){ int num = v.back(); v.pop_back(); num += v.back(); v.pop_back(); v.push_back(num); } return v.front(); } if(l.size() != plus + minus + 1){ int num = 0; while(l.size() != plus + minus){ num = num * 10 + l.back(); l.pop_back(); } l.push_back(num); } if(plus != 0){ int num = l.back(); l.pop_back(); for(int i = 0; i < plus; i++){ num += l.back(); l.pop_back(); } l.push_back(num); } int ans = l.front(); l.pop_front(); while(minus){ ans -= l.back(); l.pop_back(); minus--; } return ans; } int main(){ int n; std::cin >> n; std::list v; int plus = 0, minus = 0; for(int i = 0; i < n; i++) { char c; std::cin >> c; if(c == '+') plus++; else if(c == '-') minus++; else v.push_back(c - '0'); } std::list v2 = v; int m = max(v, plus, minus); int mi = min(v2, plus, minus); std::cout << m << " " << mi << std::endl; return 0; }