Google Code Jame - QR 2018 - problem B (python)

b.py

import sys, copy;

def solve(n,v):
    parni = []
    neparni = []
    for i in range(n):
        if i % 2 == 0:
            parni.append(v[i])
        else:
            neparni.append(v[i])
    #print v
    #print parni
    #print neparni
    parni.sort()
    neparni.sort()
    #print parni
    #print neparni
    for i in range(n-1):
        
        if i % 2 == 0:
            if parni[i/2] > neparni[i/2]:
                return i
            
            parni.append(v[i])
        else:
            if neparni[i/2] > parni[i/2 +1]:
                return i
    return "OK";

t = int(raw_input())
for i in range(1, t + 1):
    n = int(raw_input())
    v = map(int, raw_input().split())
    print "Case #" + str(i) + ": " + str(solve(n,v))