一開始想說慢慢加上去
找到比總和大的數就return
後來發先要先加完再減才是對的
2971. Find Polygon With the Largest Perimeter
class Solution {
public:
long long largestPerimeter(vector<int>& nums) {
long long sum=0;
int m=nums.size();
int count=m;
priority_queue<int> pq;
for(const int& n:nums){
sum+=n;
pq.push(n);
}
for(int i=0; i<m; i++){
if(pq.top()<sum-pq.top()) break;
sum-=pq.top();
pq.pop();
count