t = int(input())
a,b=0,0
prevp1,prevp2 = 0,0
while(t>0):
    l = list(map(int,input().split()))

using System;
namespace Codechef__TLG_ 
{
    class Program 
    {

This is more optimum than the easy solution. In this solution, I don't have to calculate the cumulative sum for both players. I am just calculating the cumulative difference that is lead. If diff is positive p1 wins else p2 wins. Max lead will be the max |diff|.

#include <iostream>

Got it to run using set+unordered_map, but now I wanted to try out the simpler while loop.

#include <bits/stdc++.h>

using namespace std;

The solution would be right if we only had to print the id numbers, We also have to print the total no. before printing the id's.

So you have to store each value in array then print ...

Here's A Recursive DP Solution of this!

Equals Gifts IARCS at master · JVJplus

yes sir plz

I submitted my solution at IARCS Problem Archive. A fatal error just keeps coming up without any reason. There seems to be this error with every C++ submission on IARCS's grader.

Here's my solution for anybody who may require help:

That's awesome Rajashekar, great job. That was quick. :)

Next step is the Competitive Programming Playlist. Its long, but just take it one step at a time. Ask questions if you get...

i completed all the beginner problems posted...after these what i need to do next?

Thanks

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

The complexity of Count Sort is O(n).

To what complexity can this solution be brought down to ? My code is O(nlogn). However, some people got O(n) without sorting. How is that possible ?

My code is available at [C++] PYRAMID.