2023.11.16 Today's Challenge

https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/

Maximum Element After Decreasing and Rearranging - LeetCode

Sorting해서 푸는 간단한 문제.
너무 간단해서 문제 이해를 못함 ㅋㅋ

class Solution:
    def maximumElementAfterDecrementingAndRearranging(self, arr: List[int]) -> int:
        arr.sort()
        ans = 1
        for i in range(1, len(arr)):
            if arr[i] >= ans + 1:
                ans += 1
        return ans