# Task

**_Given_** *an array of N integers, you have to find* **_how many times_** *you have to* **_add up the smallest numbers_** *in the array until* **_their Sum_**  *becomes greater or equal to* **_K_**.
___
 
# Notes: 

* **_List size_**  is *at least 3*.

* **_All numbers_**  *will be*  **_positive_**.

* **_Numbers_**  could  *occur more than once* ,   **_(Duplications may exist)_**.

* Threshold  **_K_**  will *always be reachable*.
___
# Input >> Output Examples

```
minimumSteps({1, 10, 12, 9, 2, 3}, 6)  ==>  return (2)
```
## **_Explanation_**:

* We  *add two smallest elements*  **_(1 + 2)_**,  *their sum is 3* .

* **_Then_**  we  **_add the next smallest number to it (3 + 3)_** , so  *the sum becomes 6* .

* **_Now_**  the result is greater or equal to **_6_** ,  *Hence the output is (2) i.e (2) operations are required to do this* .
___
```
minimumSteps({8 , 9, 4, 2}, 23)  ==> return (3)
```
## **_Explanation_**:

* We  *add two smallest elements*  **_(4 + 2)_**,  *their sum is 6* .

* **_Then_**  we  **_add the next smallest number to it (6 + 8)_** , so *the sum becomes 14* .

* **_Now_**  we  **_add the next smallest number (14 + 9)_** , so *the sum becomes 23*  .

* **_Now_**  the result is greater or equal to **_23_** ,  *Hence the output is (3) i.e (3) operations are required to do this* .
___
```
minimumSteps({19,98,69,28,75,45,17,98,67}, 464)  ==>  return (8)
```
## **_Explanation_**:

* We  *add two smallest elements*  **_(19 + 17)_**,  *their sum is 36* .

* **_Then_**  we  **_add the next smallest number to it (36 + 28)_** , so *the sum becomes 64* .

* We need to **_keep doing this_** *until **_the sum_** becomes greater or equal to **_K_** (464 in this case)*, which will require **_8_** Steps .
___
 ## Expected Time Complexity `O(n Log n)`
___
___
___

# [Playing with Numbers Series](https://www.codewars.com/collections/playing-with-numbers)

# [Playing With Lists/Arrays Series](https://www.codewars.com/collections/playing-with-lists-slash-arrays)

# [For More Enjoyable Katas](http://www.codewars.com/users/MrZizoScream/authored)
___

## ALL translations are welcomed

## Enjoy Learning !!
# Zizou

Difficulty: EASY
Starter code: def minimum_steps(numbers, value):
	

Solutions:
def minimum_steps(arr, n):
	arr = sorted(arr)
	s = 0
	for (i, v) in enumerate(arr):
		s += v
		if s >= n:
			return i


from itertools import accumulate

def minimum_steps(numbers, value):
	return next((i for (i, s) in enumerate(accumulate(sorted(numbers))) if s >= value))


def minimum_steps(numbers, value):
	return sum((sum(sorted(numbers)[:i + 1]) < value for i in range(len(numbers))))


def minimum_steps(n, v):
	k = sorted(n)[0]
	for c in range(len(n)):
		if k >= v:
			return c
		else:
			k += sorted(n)[c + 1]


def minimum_steps(numbers, value):
	sorted_n = sorted(numbers)
	(n, sum) = (0, sorted_n[0])
	for i in sorted_n[1:]:
		if sum >= value:
			break
		sum += i
		n += 1
	return n


def minimum_steps(num, v):
	(n, s) = (0, 0)
	while s < v:
		s += sorted(num)[n]
		n += 1
	return n - 1


def minimum_steps(numbers, value, s=0):
	for (i, n) in enumerate(sorted(numbers)):
		s += n
		if s >= value:
			return i


def minimum_steps(num, value):
	num.sort()
	return next((i - 1 for i in range(len(num) + 1) if sum(num[:i]) >= value), 0)


def minimum_steps(numbers, value):
	numbers.sort()
	sum = 0
	operations = 0
	for x in numbers:
		sum += x
		if sum >= value:
			break
		operations += 1
	return operations