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>

#include<iostream>

using namespace std;

int main()

"""
@author : Anidh Singh
This program solves the first assignment in the competitive programming playlist
"""
#designing the lead game solution

Online registration for both ZIO-2019 and ZCO-2019 will open on Thursday, 27 September, 2018 .

Hi, Vishnu Lokhande

The registration for ZCO and ZIO will start in the month of september , You should visit this website Indian Association f...

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 ...

C++ STL (MAP ) SOLUTION:-

#include<bits/stdc++.h>

using namespace std;

Following the algorithm provided as hint ends up in TLE. I'm using C++. But anyway this was a great problem. I don't really care about passing the judge. Just as long as I know the solution

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:

#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.