void solve()
{
    int n;cin>>n;
    int maxi = 0;
    int a,b,sum1=0,sum2=0;

`

x1, x2, temp = 0, 0, 0

for _ in range(int(input())):

p1, p2 = map(int, input().split())

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

While Keshav' s solution is time optimal, it is also necessary to check out the time constraints during competitive programming.

If you are given 1 second, you could just solve it i...

#include <algorithm>
#include <iostream>
#include <iterator>
#include <set>
#include <vector>

Can you solve it without any loops, only STL algorithms ?

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

Ok, well i founded some good sources for learning asymptotic analysis on forum and i learned it.

There is no question directly from Asymptotic Analysis. But but but.. you can't dream of being at IOI (even INOI) without being able to find the time and space complexity of your code.