#include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); // VAR(int, x); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t){std::cin >> t;} templatevoid Scan(First& first,Rest&...rest){std::cin>>first;Scan(rest...);} #define OUT(d) std::cout<<(d); #define FOUT(n, d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define PAIR std::pair #define IN(a0, y, a1, b0, x, b1) (a0<=y && y(end-start).count();std::cerr<<"[Time:"< op; REP(i, n){ char c; std::cin >> c; if('0'<=c && c<='9') chNum+=c; else op.push_back(c); } std::sort(ALL(chNum)); std::reverse(ALL(chNum)); std::vector num; int opN = op.size(); REP(i, opN){ num.push_back(std::stol(chNum.substr(chNum.size()-i-1, 1))); } num.push_back(std::stol(chNum.substr(0, chNum.size()-opN))); std::sort(ALL(op)); bool onlyPlus = op.back()=='+'; std::reverse(ALL(num)); ll max = num[0]; REP(i, opN){ switch(op[i]){ case '+': max += num[i+1]; break; case '-': max -= num[i+1]; break; } } std::reverse(ALL(num)); ll min; if(onlyPlus){ min = 0; REP(i, chNum.size()){ min += (chNum[i]-'0')*std::pow(10, i/(opN+1)); } }else{ min = num[0]; REP(i, opN){ switch(op[i]){ case '+': min += num[i+1]; break; case '-': min -= num[i+1]; break; } } } OUT(max)SP OUT(min)BR; //SHOWVECTOR(num);SHOWVECTOR(op); } ()); return 0; }