Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a 0-indexed integer array nums and two integers x and y. In one operation, you must choose an index i such that 0 <= i < nums.length and perform the following:

Decrement nums[i] by x.
Decrement values by y at all indices except the ith one.

Return the minimum number of operations to make all the integers in nums less than or equal to zero.
 
Please complete the following python code precisely:
```python
class Solution:
    def minOperations(self, nums: List[int], x: int, y: int) -> int:
```