fork(1) download

copy

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
 
void qsortfirst(pair<int,int> p[],int low,int up){
 
	if(low>=up)
		return;
	pair<int,int> temp;
	int i=low+1,j=up,pivot=p[i].first;
	while(i<=j){
		while(p[i].first<pivot)
			i++;
		while(p[j].first>pivot)
			j--;
		if(i<j){
			temp=p[i];
			p[j]=p[i];
			p[i]=temp;
			j--;
			i++;
		}
		else if(i==j)
			i++;
	}
	temp=p[j];
	p[j]=p[low];
	p[low]=temp;
	qsortfirst(p[],low,j-1);
	qsortfirst(p[],j+1,up);
}
 
int main() {
	// your code goes here
	pair<int,int> p=new p[5];
	for(int i=0;i<5;i++)
		cin>>p[i].first>>p[i].second;
	qsortfirst(p,0,5);
	for(int i=0;i<5;i++)
		cout<<p[i].first<<" "<<p[i].second;
	return 0;
}
 

prog.cpp: In function 'void qsortfirst(std::pair<int, int>*, int, int)':
prog.cpp:29:15: error: expected primary-expression before ']' token
  qsortfirst(p[],low,j-1);
               ^
prog.cpp:30:15: error: expected primary-expression before ']' token
  qsortfirst(p[],j+1,up);
               ^
prog.cpp: In function 'int main()':
prog.cpp:35:22: error: 'p' does not name a type
  pair<int,int> p=new p[5];
                      ^
prog.cpp:37:9: error: no match for 'operator[]' (operand types are 'std::pair<int, int>' and 'int')
   cin>>p[i].first>>p[i].second;
         ^
prog.cpp:37:21: error: no match for 'operator[]' (operand types are 'std::pair<int, int>' and 'int')
   cin>>p[i].first>>p[i].second;
                     ^
prog.cpp:38:18: error: cannot convert 'std::pair<int, int>' to 'std::pair<int, int>*' for argument '1' to 'void qsortfirst(std::pair<int, int>*, int, int)'
  qsortfirst(p,0,5);
                  ^
prog.cpp:40:10: error: no match for 'operator[]' (operand types are 'std::pair<int, int>' and 'int')
   cout<<p[i].first<<" "<<p[i].second;
          ^
prog.cpp:40:27: error: no match for 'operator[]' (operand types are 'std::pair<int, int>' and 'int')
   cout<<p[i].first<<" "<<p[i].second;
                           ^

Standard output is empty