Submission #163826

#	Time	Username	Problem	Language	Result	Execution time	Memory
163826		boolodifjenula	Izbori (COCI17_izbori)	Cpython 3	48 / 80	57 ms	3556 KiB

izbori

N,M,K=map(int,input().split())
L=[]
G=M*[0]
for i in range (N):
    L+=[list(map(int,input().split()))]
    G[L[i][0]-1]+=1
n=0
for i in range(M):
    if G[i]>G[n]:
        n=i
print(n+1)
if n+1==K:
    print(0)
else:
    p=0
    P=[0]
    for i in range(100):
        p+=1
        P+=[n+1]
        G=M*[0]
        for x in range(N):
            for y in range(M):
                if L[x][y] in P:
                    L[x][y]=0
                else:
                    G[L[x][y]-1]+=1
                    break
        #print(G)
        n=0
        for i in range(M):
            if G[i]>G[n]:
                n=i
        if n+1==K:
            print(p)
            break
                
                    
     
    
    

• Subtask 1: 48 / 80