TCS CODEVITA CHOCOLATE PROBLEM:

#include <bits/stdc++.h>

#define int long long

#define vi vector<int>

#define pi pair<int, int>

#define mi map<int, int>

using namespace std;

signed main() {

vector<int> numbers;

string inputLine;

getline(cin, inputLine);

istringstream inputStream(inputLine);

int val;

while (inputStream >> val) {

numbers.push_back(val);

sort(numbers.begin(), numbers.end());

int n = numbers.size();

long long k;

cin >> k;

int minIndex = 0, maxIndex = n - 1;

int maxSubArrayLength = 0;

int currentSubArrayLength = 1;

while (minIndex <= maxIndex) {

if (k < numbers[minIndex]) {
 k += numbers[maxIndex];

maxIndex--;

currentSubArrayLength--;

} else {

k -= numbers[minIndex];

minIndex++;

currentSubArrayLength++;

maxSubArrayLength = max(maxSubArrayLength, currentSubArrayLength);

cout << maxSubArrayLength;

return 0;