We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Maximum Perimeter Triangle
  5. Discussions

Maximum Perimeter Triangle

  • Aadesh11111
     + 2 comments

    My take on this, pretty similar to yours, I must say

    n = input()
arr = sorted(map(int, str(raw_input()).split()))[::-1]

try:
	while (arr[1] + arr[2] <= arr[0]):
		arr.remove(arr[0])
	print arr[2],arr[1],arr[0]
except:
	print -1