leetcode/1403.cpp at master · Yashbhatt7/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include<iostream>
#include<vector>
#include<algorithm>

std::vector<int> minSubsequence(std::vector<int>& nums) {
    std::vector<int> result;

    std::sort(nums.begin(), nums.end(), std::greater<int>());

    int totalSum = 0;
    int sum = 0;

    for(int i = 0; i < nums.size(); ++i) {
        totalSum += nums[i];
    }

    for(int i = 0; i < nums.size(); ++i) {
        totalSum -= nums[i];
        sum += nums[i];
        result.push_back(nums[i]);
        if(sum > totalSum) {
            break;
        }
    }

    return result;
}

int main() {
    std::vector<int> nums = { 4, 3, 10, 9, 8 };

    std::vector<int> vec = minSubsequence(nums);

    for(const auto& v : vec) {
        std::cout << v << " ";
    }

    std::cin.get();
}