main.go

package main

import (
	"math"
	"sort"
)

type el struct {
	value int
	first bool
}

type SortContainer struct {
	elements []el
}

func (s *SortContainer) Len() int {
	return len(s.elements)
}
func (s *SortContainer) Less(i, j int) bool {
	return s.elements[i].value < s.elements[j].value
}
func (s *SortContainer) Swap(i, j int) {
	buf := s.elements[i]
	s.elements[i] = s.elements[j]
	s.elements[j] = buf
}

func main() {

}

func calc(first, second []int) int {
	var elements []el
	for _, i := range first {
		elements = append(elements, el{
			value: i,
			first: true,
		})
	}
	for _, i := range second {
		elements = append(elements, el{
			value: i,
			first: false,
		})
	}
	container := &SortContainer{elements: elements}
	sort.Sort(container)
	min := math.MaxFloat64
	last := container.elements[0].value
	onFirst := container.elements[0].first
	for _, e := range container.elements[1:] {
		if onFirst != e.first {
			if onFirst {
				min = math.Min(math.Abs(float64(last-e.value)), min)
			} else {
				min = math.Min(math.Abs(float64(e.value-last)), min)
			}
			last = e.value
			onFirst = e.first
		}
	}
	return int(min)
}