Submission #2667700

---

Source Code Expand

///
// File:  c.go
// Author: ymiyamoto
//
// Created on Wed Jun 13 23:37:46 2018
//
package main

import (
	"fmt"
	"sort"
)

var W, H int
var p, q []int

func main() {
	fmt.Scan(&W, &H)

	n := (W+1)*(H+1) - 1

	p = make([]int, W)
	q = make([]int, H)

	for i := range p {
		fmt.Scan(&p[i])
	}
	sort.Ints(p)

	for i := range q {
		fmt.Scan(&q[i])
	}
	sort.Ints(q)

	ans := 0
	var h, w int
	for n > 0 {
		if w < len(p) && p[w] < q[h] {
			ans += (H + 1 - h) * p[w]
			n -= H + 1 - h
			w++
		} else {
			ans += (W + 1 - w) * q[h]
			n -= W + 1 - w
			h++
		}
	}

	fmt.Println(ans)
}

Submission Info

Judge Result