fork download
copy 
  1. gr = int(input())
  2. mas = [0 for _ in range(gr)]
  3. n = int(input())
  4. cnt = 0
  5. temp = 0
  6. bestfrog = 0
  7. check = True
  8. for tour in range(n):
  9. 	x, y = map(int,input().split())
  10. 	mas[x-1] += y
  11. 	maxel =0
  12. 	maxidx = 0
  13. 	for i in range(len(mas)):
  14. 		if mas[i] > maxel:
  15. 			maxel = mas[i]
  16. 			maxidx = i
  17. 	for i in range(len(mas)):
  18. 		if mas[i] == mas[maxidx] and i != maxidx:
  19. 			check = False
  20. 	if bestfrog == maxidx and check:
  21. 		temp += 1
  22. 	else:
  23. 		cnt = max(cnt, temp)
  24. 		if check:
  25. 			temp = 1
  26. 		else:
  27. 			temp = 0
  28. 	check = True
  29. 	bestfrog = maxidx
  30. print(cnt)
Success #stdin #stdout 0.08s 14152KB
comments (?)
stdin
copy 
4
6
2 2
1 2
3 3
4 1
2 2
3 1
stdout
copy 
2
https://ideone.com/QKq6pR
language:
Python 3 (python  3.12)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!