Given an int array `wood` representing the length of `n` pieces of wood and an int `k`. It is required to cut these pieces of wood such that more or equal to `k` pieces of the same length `len` are cut. What is the longest `len` you can get?\n\n**Example 1:**\n```\nInput: wood = [5, 9, 7], k = 3\nOutput: 5\nExplanation: \n5 -> 5\n9 -> 5 + 4\n7 -> 5 + 2\n```\n\n**Example 2:**\n```\nInput: wood = [5, 9, 7], k = 4\nOutput: 4\nExplanation: \n5 -> 4 + 1\n9 -> 4 * 2 + 1\n7 -> 4 + 3\n```\n\n**Example 3:**\n```\nInput: wood = [1, 2, 3], k = 7\nOutput: 0\nExplanation: We cannot make it.\n```\n\n**Example 4:**\n```\nInput: wood = [232, 124, 456], k = 7\nOutput: 114\nExplanation: We can cut it into 7 pieces if any piece is 114 long, however we can\'t cut it into 7 pieces if any piece is 115 long.\n```\n\n-----------\nRelated problems:\n* https://leetcode.com/problems/koko-eating-bananas/

Given an int array wood representing the length of n pieces of wood and an int k. It is required to cut these pieces of wood such that more or equal to k pieces