求调，过了sub#1和hack

#include<iostream>
#include<algorithm>
using namespace std;
int main() {
	int a, n, cnt = 0, minn = 2147483647;// cnt 统计 0 的数量
	long long sum = 0;
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> a;
		sum += a;
		if(!a) cnt++;
		if(a < minn && a != 0) minn = a;
	}
	if(n == 1) {
		cout << a << endl;
	} else {
		if(minn == 2147483647) {
			cout << 2 * cnt - 1 << endl;
		} else if(minn == 1) {
			cout << sum + 2 * cnt;
		} else {
			cout << sum + 1 + 2 * cnt - 2;
		}
	}
	return 0;
}