面的android职位，是一个国人，英语巨烂，题目是题库里的经典题目（我随后才知道）
Given a set of pins with attributes (pin id, height), write a function that takes the argument ‘‘k’’ (determining the number of columns) and inserts the pins such that every pin goes into a column with least consumed height. If there is a tie then insert into the left most column
但是搞了好久他讲不清我也问不清，到最后都没理解题意，也不知道到底要求啥的，但是感觉他其实是专门给题库的题想要放水，可真的到最后都没理解题意，觉得自己太笨了，史上最窝囊的电面。。