Solved it this way LOL

#include <algorithm>
#include <cstdio>
#include <cstring>

Thanks

https://discuss.codechef.com/questions/89790/table-sum-time-complexity

This might help: International Olympiad in Informatics: Path to Gold

This playlist is mostly based on IARCS syllabus and previous years' papers' trends.

#include <bits/stdc++.h>

using namespace std;

int N,K;
vector<long long> V,B; vector<vector<long long>> dp;

long long max (long long a, long long b)
{
return (a>b)?a:b;
}...

No. I have not solved it yet. But as many people are pointing out - O(n^3) is working. So, maybe I will give it a try.

Were you able to solve the 2nd test case without TLE ?

Another way to use min_heap would be to multiply all your entries by -1 before inserting it into the priority queue.

Yes. You can also use a set as a priority queue / heap, since a set supports strictly more functionality. I expect sets to be 2-5x slower than heaps / priority queues because it is maintaining a Balanced Binary Search Tree (BBST). 95% of the time, 2-5x slower doesn't matter.

Yeah, could someone please clarify if a set would work out?

Why have you done this -

ans = max(ans, first_task + people[i][1])

won't first_task + people[i][1] always be bigger than ans?

Here's my really simple code if anybody needs help

#include<iostream>
#include<algorithm>
using namespace std;

I also wrote the same comparision function, and having same doubt.

#include <bits/stdc++.h>

using namespace std ;

#define mem(x,val) memset((x),(val),sizeof(x))

#define all(x) x.begin(),x.end()

I would love to see a stack based dfs solution to this problem? If anyone solved by that method please share.

C++ (AC) Solution:

#include <iostream>
#include <vector>
#include <queue>