# The Magic Wand – TechGig PHP answer, all test cases passed. Challenge #2

The Magic Wand – TechGig PHP answer – all testcases passed

### The Magic Wand (100 Marks)

You are a wizard who possesses the magic wand that can be used to change the values of an array. Your wand has two powers: Increase and Decrease. With each use of the wand, you can either increase or decrease any element of the array by 1.

One day, a group of villagers came to you with a problem. They had an array of positive integers of size N and a set of queries of size M. For each query, queries[i], they wanted to make all the elements of the array equal to queries[i] using your magic wand.

To help the villagers, you decided to use your magic wand to perform the operations. However, each time you perform an operation, the cost of using your wand increases. The cost of using your wand for an operation on an element is equal to the absolute difference between the value of the element and the desired value after the operation.

Example:

If you want to change an element from 5 to 3, it will cost you 2. If you want to change an element from 7 to 8, it will cost you 1.

You can perform any number of operations on any element of the array for a given query. However, the cost of using the wand for each operation accumulates, and you want to minimize the total cost of all operations for each query.

##### Input Format

The first line of the input consists of two space-separated integers N (length of array) and M (length of queries).

The second line of input consists of N space-separated integers arr[i].

The third line of input consists of M space-separated integers queries[i].

##### Constraints

1 <= N <= 10^5

1 <= M <= 10^5

1 <= arr[i] <= 10^9

1 <= queries[i] <= 10^9

##### Output Format

Print a list of integers of cost of length m, where cost[i] is the minimum cost to make all elements of nums equal to queries[i].

Sample TestCase 1

``````Input
5 3
1 2 3 4 5
5 2 1``````
``````Output
10 7 10``````
###### Explanation

Number of array elements, N = 5

Number of Queries,M = 3

For the first query, queries[0] = 5, you can increase the elements at indices 0, 1, 2, and 3 by 4, 3, 2 and 1 respectively. Total cost of operations = 10.

For the second query, queries[1] = 2, you can decrease the elements at indices 2, 3, and 4 by 1, 2, and 3, and increase the element at index 0 by 1. Total cost of operations = 7. For the third query, queries[2] = 1, you can decrease the elements at indices 4, 3, 2, and 1, by 4, 3, 2 and 1. Total cost of operations = 10

``````<?php

function min_energy(\$arr, \$queries) {
\$min_costs = [];

foreach (\$queries as \$query) {
\$cost = 0;
foreach (\$arr as \$element) {
if (\$element > \$query) {
\$cost += \$element - \$query;
} else {
\$cost += \$query - \$element;
}
}
\$min_costs[] = \$cost;
}

return \$min_costs;
}

\$fp = fopen('php://stdin', 'r');

list(\$N, \$M) = explode(" ", trim(fgets(\$fp)));

\$arr = array_map('intval', explode(" ", trim(fgets(\$fp))));

\$queries = array_map('intval', explode(" ", trim(fgets(\$fp))));

// Call the function to get minimum costs
\$min_costs = min_energy(\$arr, \$queries);

// Print the minimum costs
echo implode(" ", \$min_costs);

// Close the file pointer
fclose(\$fp);

?>``````

Here is the link to The Magic Wand.

Here is the first test solution : Forest Fire