Envío 5118

Código

package main

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

type Case struct {
	Index int
	Case  int64
}

func main() {

	reader := bufio.NewReader(os.Stdin)

	nString, _ := reader.ReadString('\n')
	nString = strings.ReplaceAll(nString, "\n", "")
	n, _ := strconv.Atoi(nString)
	numbersS, _ := reader.ReadString('\n')
	numbersS = strings.ReplaceAll(numbersS, "\n", "")
	numbers := strings.Split(numbersS, " ")

	cString, _ := reader.ReadString('\n')
	cString = strings.ReplaceAll(cString, "\n", "")

	c, _ := strconv.Atoi(cString)

	results := make([]int, c)
	orderedArray := make([]Case, 0)

	for i := 0; i < c; i++ {
		numberString, _ := reader.ReadString('\n')

		numberString = strings.ReplaceAll(numberString, "\n", "")
		number, _ := strconv.ParseInt(numberString, 10, 64)

		orderedArray = append(orderedArray, Case{
			Index: i,
			Case:  number,
		})
		results[i] = n

	}
	orderedArray = mergeSortNumbers(orderedArray)
	indexCases := 0
	for i := 0; i < n && indexCases < c; i++ {
		number, _ := strconv.ParseInt(numbers[i], 10, 64)
		numberCase := orderedArray[indexCases]
		if number > numberCase.Case {
			results[numberCase.Index] = i
			indexCases++
			i--
		}

	}
	for _, value := range results {
		fmt.Println(value)
	}

}

func mergeSortNumbers(array []Case) []Case {
	if len(array) == 1 {
		return array
	}

	lenArrayMid := int(len(array) / 2)

	array1 := mergeSortNumbers(array[:lenArrayMid])
	array2 := mergeSortNumbers(array[lenArrayMid:])

	mergeArray := make([]Case, 0)
	i := 0
	j := 0
	for i < len(array1) && j < len(array2) {
		numberOne := array1[i].Case
		numberTwo := array2[j].Case
		if numberOne < numberTwo {
			mergeArray = append(mergeArray, array1[i])
			i++
		} else {
			mergeArray = append(mergeArray, array2[j])
			j++
		}
	}

	if i < len(array1) {
		mergeArray = append(mergeArray, array1[i:]...)
	} else if j < len(array2) {
		mergeArray = append(mergeArray, array2[j:]...)
	}

	return mergeArray
}