Algorithm for finding minimum distance between pixel and groups of pixles

Question

I need algorithm(preferably in c++ though pseudo code is ok too) to find a group among groups of pixels that have minimum distance to one particular pixel.

The distance is defined as sum of distances of each pixel of the group to the particular pixel while each distance is equal |x|+|y| coordinates.

If its not clear enough I will try to clarify you

Thank you