Can you please help debug my code.I tried really hard.
#include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long intl;
vector< pair<intl,intl> > arr;
intl n;
cin>>n;
for(intl i=0;i<n;i++)
{ intl x,y,z;
cin>>x>>y>>z;
arr.push_back({y+z,x});
}
sort(arr.rbegin(),arr.rend());
for(intl i=1;i<n;i++)
{
arr[i].second += arr[i-1].second;
 
}
 
for(intl i=1;i<n;i++)
{
arr[i].first+=arr[i].second;

I wrote a code for this problem, in the test cases in set 1, all the cases were accepted.But in set two they were showing runtime error.And also as the memory limit is 50000 byte, is it the case that we are using more memory than allowed?

The code got accepted
But I am quite new to programming, any constructive feedback is welcome.
 
#include<bits/stdc++.h>
using namespace std;
int main()
{
typedef long long intl;
intl n,x,y,pair1,pair2,time1,time2;
cin>>n>>x>>y;
vector<intl> V, W,temp;
vector< vector<intl> > E;
V.push_back(-1);
W.push_back(INT_MAX);
for(intl i=0;i< n;i++)
{ cin>>pair1>>pair2;
  temp.push_back(pair1);
        temp.push_back(pair2);
     temp.push_back(INT_MAX);
E.push_back(temp);
temp.clear();
 }
for(intl i=0;i<x;i++)
{

Thanks a lot. I got it now. :)

Hey. I have been programming sometimes since last year and I can't seem to improve my coding speed. I am solving questions from the playlist and coding the solutions are taking me 2 hours each on the average. Any suggestion for improvement? Thanks a lot.

 #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
 int n;int a,b;vector<int> arr;
 cin>>n;
 for(int i=0;i<n;i++)
 { cin>>a ; cin>>b;
     arr.push_back(min(a,b));
 }
  sort(arr.begin(),arr.end());
  int start=0,i=0;
  for( i=1;i<n;i++)
  {int k = lower_bound(arr.begin()+start,arr.begin()+n,i)-arr.begin();
   start = k+1;
   if(k>=n) break;
  }
  cout<<i-1;
 }

This is my solution, It's showing accepted. Any feed...

it should have been 'with' I guess.

Can you please check my code too. It is failing in a few test cases. I sorted two vectors. Then found the one with the maximum overall.Took an iterator to it's beginning and another to the other's end.Then started swapping k times if the swaps are beneficial. Attaching my code herewith. Another problem I am facing is that, I am quite quick in finding an algorithm.But take way too long to write the code properly.

#include <iostream>
#include<algorithm>
#include<climits>
#include<vector>
#include<string>
using namespace std;
int main()
{    
     int n, k; vector<int>  selves1, selves2;int skew; int max1,max2,maxall;
     vector<int>::iterator bigger,smaller;
     cin>>n;
     cin>>k;
     for(int i=0;i<n;i++){
         cin>>skew;
 

Can you please check what is wrong with the code? wrong ans

#include <iostream>
using namespace std;
 
int main() {
	int n,p1temp,p2temp,p1=0,p2=0,diff,diffinal=0,win1=0,win2=0;
	cin>>n;
	for(int i=0;i<n;i++)
{	cin>>p1temp>>p2temp;
	p1+=p1temp;p2+=p2temp;
	p1>p2 ? diff = p1-p2 : diff = p2-p1;
	if(diff>diffinal){diffinal =diff; if(p1>p2){ win1=1;win2=0;} else {win2=1;win1=0;}}
}
win1==1? cout<<"1"<<" "<<diffinal : cout<<"2"<<" "<<diffinal;
	return 0;
}