1749B.go

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)

// source: https://codeforces.com/contest/1749/problem/B?locale=en
func solve() {
	n, a := _readArr()
	_, b := _readArr(n)
	_print(_sum(a...) + _sum(b...) - _max(b...))
}

func solve_() {
	n := _readInt()
	_, a := _readArr(n)
	_, b := _readArr(n)
	res := 0

	cast := func(x int) {
		d := b[x]
		if x > 0 {
			a[x-1] += d
		}
		if x < len(a)-1 {
			a[x+1] += d
		}
		a = append(a[:x], a[x+1:]...)
		b = append(b[:x], b[x+1:]...)
	}

	next := func() int {
		mi, mv := 0, b[0]
		for i := 1; i < len(b)-1; i++ {
			if b[i]*2 < mv {
				mi = i
				mv = b[i] * 2
			}
		}
		if i := len(b) - 1; b[i] < mv {
			mi = i
		}
		return mi
	}

	for len(a) > 0 {
		i := next()
		res += a[i]
		cast(i)
	}

	_print(res)
}

func main() {
	defer out.Flush()
	var t int
	for fmt.Fscanln(in, &t); t > 0; t-- {
		solve()
	}
}

// ====
func _readInt() int {
	var x int
	fmt.Fscan(in, &x)
	return x
}
func _readStr() string {
	var x string
	fmt.Fscan(in, &x)
	return x
}
func _readArr(x ...int) (int, []int) {
	var n int
	if len(x) == 0 {
		fmt.Fscan(in, &n)
	} else {
		n = x[0]
	}
	var v = make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(in, &v[i])
	}
	return n, v
}
func _print(x ...any) {
	fmt.Fprintln(out, x...)
}
func _max(x ...int) int {
	mi := 0
	for i := 1; i < len(x); i++ {
		if x[i] > x[mi] {
			mi = i
		}
	}
	return x[mi]
}
func _min(x ...int) int {
	mi := 0
	for i := 1; i < len(x); i++ {
		if x[i] < x[mi] {
			mi = i
		}
	}
	return x[mi]
}
func _sum(x ...int) int {
	res := 0
	for _, i := range x {
		res += i
	}
	return res
}
func _abs(x int) int {
	if x < 0 {
		return -x
	}
	return x
}
func _sortStr(x string) string {
	r := []rune(x)
	sort.Slice(r, func(i, j int) bool {
		return r[i] < r[j]
	})
	return string(r)
}
func _reverseInts(x []int) {
	n := len(x)
	for i := 0; i < n/2; i++ {
		x[i], x[n-1-i] = x[n-1-i], x[i]
	}
}
func _reverseStr(s string) string {
	x := []rune(s)
	n := len(x)
	for i := 0; i < n/2; i++ {
		x[i], x[n-1-i] = x[n-1-i], x[i]
	}
	return string(x)
}
func _makeMatrix(n, m int) [][]int {
	x := make([][]int, n)
	for i := range x {
		x[i] = make([]int, m)
	}
	return x
}