简单贪心,把负数全放一个集合,非负数全放一个集合,差一定是最大的
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 105;
int n;
int a[N];
int main()
{
scanf("%d",&n);
for (int i = 1; i <= n; i ++ ) scanf("%d",&a[i]);
int sum1 = 0,sum2 = 0;
for (int i = 1; i <= n; i ++ ){
if(a[i] < 0) sum2 += a[i];
else sum1 += a[i];
}
cout << sum1 - sum2 << endl;
return 0;
}