Orange cap using Python

See more:

Python3.6

We represent scores of batsmen across a sequence of matches in a two level dictionary as follows:

{'match1':{'player1':57, 'player2':38}, 'match2':{'player3':9, 'player1':42}, 'match3':{'player2':41, 'player4':63, 'player3':91}

Each match is identified by a string, as is each player. The scores are all integers. The names associated with the matches are not fixed (here they are 'match1','match2','match3'), nor are the names of the players. A player need not have a score recorded in all matches.

Define a Python function orangecap(d) that reads a dictionary d of this form and identifies the player with the highest total score. Your function should return a pair (playername,topscore) where playername is a string, the name of the player with the highest score, and topscore is an integer, the total score of playername.

The input will be such that there are never any ties for highest total score.

For instance:

>>> orangecap({'match1':{'player1':57, 'player2':38}, 'match2':{'player3':9, 'player1':42}, 'match3':{'player2':41, 'player4':63, 'player3':91}})
('player3', 100)

>>> orangecap({'test1':{'Ashwin':84, 'Kohli':120}, 'test2':{'ashwin':59, 'Pujara':42}})
('Kohli', 120)

What I have tried:

l=[]
p=[]
s1=[]
s2=[]
def orangecap(d):
t=0
temp=-1
if len(d)==0:
return {}
for z in d:
for x in d[z]:
p.append(x)
a=d[z][x]
l.append(a)
for i in p:
temp=temp+1
if len(s1)==0:
s1.append(i)
s2.append(l[0])

else:
for j in range(len(s1)):
if i==s1[j]:
s2[j]=s2[j]+l[temp]
t=t+1
if t==0:
s1.append(i)
s2.append(l[p.index(i)])
t=0
return s1[s2.index(max(s2))],max(s2)

I did the whole Program but still i can Clear only the 9 Testcases of 10.
Even I tried it in different ways but still it clears only 9 Private Testcases of 10