package main

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

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

type pair struct {
	a, b int
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	N := getI()
	x := make([]pair, N)
	tot := 0
	for i := 0; i < N; i++ {
		x[i].a = getI()
	}
	for i := 0; i < N; i++ {
		x[i].b = getI()
		tot += x[i].b
	}
	sort.Slice(x, func(i, j int) bool {
		return x[i].a < x[j].a
	})

	val := -1
	cnt := 0
	mid := tot / 2
	for i := 0; i < N; i++ {
		if cnt <= mid && mid <= cnt+x[i].b {
			val = x[i].a
			break
		}
		cnt += x[i].b
	}
	// val1 := -1
	// cnt = 0
	// for i := N - 1; i >= 0; i-- {
	// 	if cnt <= mid && mid <= cnt+x[i].b {
	// 		val1 = x[i].a
	// 		break
	// 	}
	// 	cnt += x[i].b
	// }

	// val := float64(val0+val1) / 2.0
	f := 0
	for i := 0; i < N; i++ {
		f += x[i].b * abs(val-x[i].a)
	}
	out(val, f)
}