I can't find link preview

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

Showing "crashed" as the reason.

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

I'm guessing that by B, you mean the max degree?

Why is the solution O(NB)? Isn't it just O(N)? I'm trying to figure out why the max degree constraint is given in the prob...

    int N; cin >> N;
    int A[N]; for(int i=0;i<N;++i) cin >> A[i];
    

#include <stdio.h>
#include <iostream>
#include <climits>
#include <map>
#include <cmath>

n = int(input())
gaps = []
for i in range(n):
    gaps.append(list(map(int, input().split())))
gaps.sort(key=lambda x: x[0])

Completed in 0.00 sec. Here is my solution if anyone needs help:

#include <bits/stdc++.h>
 
using namespace std;

Are you sure this works? Because, I made a code with the exact same logic, only difference being instead of vector, I made an array of structure; and it does not work.

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>

Can maximum nesting depth be equal to maximum no. of symbols between two brackets in this problem.

//package commonlounge;
 
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;

Here is my solution to this problem which actually teaches you how useful stack can be for such problems (although this problem can be solved without using stack, my code rather tries to teach people starting out the usage of stack and bracket matching).

Thanks