Find Kth Element in Array

Write a Python function `kth_element(arr, k)` that takes a list `arr` of integers and an integer `k` (1-based index) as input and returns the kth smallest element in the array. The function should sort the array in ascending order and then return the element at the (k-1)th index.

#### Example Usage
```python [main.nopy]
print(kth_element([12, 3, 5, 7, 19], 2))  # Output: 5
print(kth_element([17, 24, 8, 23], 3))    # Output: 23
print(kth_element([16, 21, 25, 36, 4], 4)) # Output: 25
```

#### Constraints
- The input array will have at least `k` elements.
- The input array will contain distinct integers.
def kth_element(arr, k):
    """
    Find the kth smallest element in the array using 1-based indexing.

    Args:
        arr (list): A list of distinct integers.
        k (int): The 1-based index of the element to find.

    Returns:
        int: The kth smallest element in the array.
    """
    # Sort the array in ascending order
    # Return the element at the (k-1)th index
    pass
Intermediate lists
More challenges to try
Cumulative Sum of Tuple List Find Smallest Number Generate List of Empty Dictionaries Find Minimum in Heterogeneous List Max Difference in Pairs Sort students by age Find Element After Rotations Largest Sum in Repeated Array Find First Odd Number Find N Largest Integers