Help with 279B

Revision en1, by CodeRazer, 2022-09-10 04:00:23


279B - Books

My approach

The total time taken to read all books is sum. Then for every iteration if the sum is greater than the free time you can either remove the first book or the last book in the series, it's better to remove the book with the higher read duration for optimal solution (It is optimal because, since we have to remove a book, it's better to remove the one with the higher read duration to have more potential time for reading other books). If there are any doubts regarding the approach, refer to the code.


#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define ll long long

using namespace std;

int main(void) {
    ll n, t; cin >> n >> t;
    vector<ll> a(n);
    ll sum = 0;
    for (ll i = 0; i < n; ++i) {
        cin >> a[i];
        sum += a[i];
    ll lo = 0;
    ll hi = n - 1;
    while (sum > t && hi >= lo) {
        if (a[lo] > a[hi]) {
            sum -= a[lo];
        } else {
            sum -= a[hi];
    cout << hi - lo + 1 << endl;


Obviously my approach or program (or both) are incorrect, but I'm having a hard time finding what is wrong. I would appreciate any help. Thanks in advance :)


  Rev. Lang. By When Δ Comment
en1 English CodeRazer 2022-09-10 04:00:23 1364 Initial revision (published)