Write a program to find the kth maximum element in an array.
Implement find_kth_maximum(nums, k), where nums is a non-empty list of integers and k is one-indexed. Return the kth largest value, counting duplicate values as separate elements. Assume 1 <= k <= len(nums).
def find_kth_maximum(nums, k):