[BOJ] 12841 : 정보대 등산

#include <cstdio>
typedef long long ll;
int n, i;
ll a[100001], b[100001], c[100002];

int main() {
	scanf("%d", &n);
	for (i = 1; i <= n; i++) scanf("%lld", c + i);
	for (i = 2; i <= n; i++) scanf("%lld", a + i), a[i] += a[i-1];
	for (i = 2; i <= n; i++) scanf("%lld", b + i), b[i] += b[i-1];

	ll pos = 1, sum = 1e18;
	for (i = 1; i <= n; i++) {
		if (a[i] + b[n] - b[i] + c[i] < sum)
			sum = a[i] + b[n] - b[i] + c[i], pos = i;
	}

	printf("%lld %lld\n", pos, sum);


	return 0;
}