Case 3/5 RE Case 1/2/4 AC

代码如下：

//C++
#include <bits/stdc++.h>
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    int capacity;
    cin >> capacity;
    if (capacity < 2) {
        cout << 0;
        return 0;
    }
    vector<int> primeVector;
    vector<bool> isPrime (capacity, true);
    isPrime[0] = false;
    isPrime[1] = false;
    for (int i = 2; i < capacity; ++i) {
        if (isPrime[i]) {
            primeVector.push_back(i);
            for (int j = i * i; j < capacity; j = j + i) {
                isPrime[j] = false;
            }
        }
    }
    int sum = 0;
    int count = 0;
    for (int i = 0; i < primeVector.size() && sum <= capacity - primeVector[i]; ++i) {
        sum += primeVector[i];
        cout << primeVector[i] << endl;
        count++;
    }
    cout << count;
    return 0;
}