### GiveawayToys(input: Array<int>): int

#### Problem Description:

You are given an array of integers where:

- The first element represents the total number of toys available for distribution.
- The remaining elements represent the number of toys each child currently wants.

Your goal is to distribute the toys in such a way that the sum of pairwise differences between the number of toys each child wants is minimized.

#### Constraints:

- You can only reduce the number of toys each child wants, not increase it.
- You do not need to distribute all the toys.

#### Output:

- Return the minimized sum of pairwise differences between the number of toys each child wants.

#### Example:

Given the input array `[5, 3, 1, 2, 1]`:

- Total toys to distribute: 5
- Initial wants of children: [3, 1, 2, 1]
2
1
1

you get the pairwise difference between the children and distribute the toys based on that.
you get this as the pairwise difference between the 

By distributing the toys optimally:

- Distribute 3 toys to get the final wants as `[1, 1, 1, 1]`.
- The pairwise differences between each child's wants are minimized.

In this case, the function should return `0` because the final pairwise differences sum is zero.