For problem statement at 1000-1999/1300-1399/1360-1369/1367/problemF1.txt this is a correct solution, but verifier at 1000-1999/1300-1399/1360-1369/1367/verifierF1.go ends with case 2 failed
input:
1
42
54 26 2 78 4 6 36 66 34 50 70 85 44 19 96 22 77 43 57 58 39 46 40 49 39 62 95 49 23 39 27 26 24 97 2 68 42 57 75 64 70 20
expected:37
got:38
exit status 1 can you fix the verifier? package main

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

type FastScanner struct {
	r *bufio.Reader
}

func NewFastScanner() *FastScanner {
	return &FastScanner{r: bufio.NewReaderSize(os.Stdin, 1<<20)}
}

func (fs *FastScanner) NextInt() int {
	sign, val := 1, 0
	c, _ := fs.r.ReadByte()
	for (c < '0' || c > '9') && c != '-' {
		c, _ = fs.r.ReadByte()
	}
	if c == '-' {
		sign = -1
		c, _ = fs.r.ReadByte()
	}
	for c >= '0' && c <= '9' {
		val = val*10 + int(c-'0')
		c, _ = fs.r.ReadByte()
	}
	fs.r.UnreadByte()
	return sign * val
}

func main() {
	in := NewFastScanner()
	out := bufio.NewWriterSize(os.Stdout, 1<<20)
	defer out.Flush()

	t := in.NextInt()
	for ; t > 0; t-- {
		n := in.NextInt()
		a := make([]int, n)
		b := make([]int, n)
		for i := 0; i < n; i++ {
			a[i] = in.NextInt()
			b[i] = a[i]
		}

		sort.Ints(b)
		rank := make(map[int]int, n)
		for i, v := range b {
			rank[v] = i
		}

		pos := make([]int, n)
		for i, v := range a {
			pos[rank[v]] = i
		}

		best, cur := 1, 1
		for i := 1; i < n; i++ {
			if pos[i-1] < pos[i] {
				cur++
			} else {
				if cur > best {
					best = cur
				}
				cur = 1
			}
		}
		if cur > best {
			best = cur
		}

		fmt.Fprintln(out, n-best)
	}
}