Beauty Code (Acolite)
Python 3✅

public int findmaxdistinctitems(int n, int k, Integer[] arr) {
        Set<Integer> set = new HashSet<Integer>(new ArrayList<Integer>(Arrays.asList(arr)));

        int sum = 0;
        int result = arr.length;
        for (int i = 1; i <= n && sum + i <= k; i++) {
            if (!set.contains(i)) {
                sum += i;
                result++;
            }
        }
        return result;
    }


Oracle✅