我需要一种快速的方法来找到NxN数组中M个最大元素的二维位置和值。现在我正在这样做:structSourcePoint{Pointpoint;floatvalue;}SourcePoint*maxValues=newSourcePoint[M];maxCoefficients=newSourcePoint*[for(intj=0;jmaxValues[0].value){intq=1;while(sample>maxValues[q].value&&qPoint结构只是两个整数-x和y。此代码基本上对传入的值进行插入排序。maxValues[0]始终包含具有最低值的SourcePoin