#include<bits/stdc++.h>
using namespace std;
int n,m,s,maxx=-1,minn=1<<30;
long long ans=0;
int main() {
	cin>>n>>m;
	if(m==0) {//m==0，无最小值可牺牲的特判
		for(int i=1; i<=n+m+1; i++)cin>>s,ans+=s;//全加
		cout<<ans;
		return 0;
	}
	for(int i=1; i<=n+m+1; i++) {
		cin>>s;
		ans+=abs(s);
		maxx=max(maxx,s);
		minn=min(minn,s);//求最小值
	}
	cout<<(maxx-minn)+ans-abs(maxx)-abs(minn);//print，牺牲最小值
	return 0;
}

下次发链接

半对

#include <iostream>
using namespace std;

int main(){
    int N, M;
    cin >> N >> M;
    for(int i = 1; i < N + M + 2; i++){
        cin >> i;
        int m;
        m = min(i, m);
    	cout << i + i - m - m << endl;
    }
	
    return 0;
}