leetcode

0 class Solution {

1 public:

2 long long largestPerimeter(vector<int> &nums) const {

3 sort(begin(nums), end(nums));

4

5 long long res = -1, crnt = 0;

6 for (int i = 0; i < size(nums); i++) {

7 crnt += nums[i];

8 if (crnt > nums[i] * 2) res = crnt;

9 }

10

11 return res;

12 }

13 };