Given set of points in 2d space, each with some penalty, find a convex region covering exactly N points, minimizing penalty

Question

Is there an algorithm for this? It\'s okay if it\'s an approximation or adds further constraints to simplify. Here\'s a more detailed statement

I have K points in s