Pagini recente » Cod sursa (job #2400852) | Cod sursa (job #932353) | Cod sursa (job #2459945) | Cod sursa (job #1002848) | Cod sursa (job #2138440)
#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int sir[1005];
int mat[50005];
int sum;
void citire(){
scanf("%d", &n);
for(int i = 1; i <= n; i++){
scanf("%d", &sir[i]);
sum += sir[i];
}
}
void solve(){
for(int i = 1; i <= n; i++){
for(int j = sum / 2; j >= sir[i]; j--){
mat[j] = max(mat[j], mat[j - sir[i]] + sir[i]);
}
}
int maxS = 0;
for(int i = 1; i <= sum / 2; i++){
maxS = max(maxS, mat[i]);
}
printf("%d %d", maxS, sum - maxS);
}
int main()
{
freopen("jocul.in", "r", stdin);
freopen("jocul.out", "w", stdout);
citire();
solve();
return 0;
}