#include <iostream>
#include<bits/stdc++.h>
using namespace std;
pair<int,int> p[];
void qsortfirst(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
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;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwpwYWlyPGludCxpbnQ+IHBbXTsKdm9pZCBxc29ydGZpcnN0KHBbXSxpbnQgbG93LGludCB1cCl7CgkKCWlmKGxvdz49dXApCgkJcmV0dXJuOwoJcGFpcjxpbnQsaW50PiB0ZW1wOwoJaW50IGk9bG93KzEsaj11cCxwaXZvdD1wW2ldLmZpcnN0OwoJd2hpbGUoaTw9ail7CgkJd2hpbGUocFtpXS5maXJzdDxwaXZvdCkKCQkJaSsrOwoJCXdoaWxlKHBbal0uZmlyc3Q+cGl2b3QpCgkJCWotLTsKCQlpZihpPGopewoJCQl0ZW1wPXBbaV07CgkJCXBbal09cFtpXTsKCQkJcFtpXT10ZW1wOwoJCQlqLS07CgkJCWkrKzsKCQl9CgkJZWxzZSBpZihpPT1qKQoJCQlpKys7Cgl9Cgl0ZW1wPXBbal07CglwW2pdPXBbbG93XTsKCXBbbG93XT10ZW1wOwoJcXNvcnRmaXJzdChwW10sbG93LGotMSk7Cglxc29ydGZpcnN0KHBbXSxqKzEsdXApOwp9CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXBbXT1uZXcgcFs1XTsKCWZvcihpbnQgaT0wO2k8NTtpKyspCgkJY2luPj5wW2ldLmZpcnN0Pj5wW2ldLnNlY29uZDsKCXFzb3J0Zmlyc3QocCwwLDUpOwoJZm9yKGludCBpPTA7aTw1O2krKykKCQljb3V0PDxwW2ldLmZpcnN0PDwiICI8PHBbaV0uc2Vjb25kOwoJcmV0dXJuIDA7Cn0K
prog.cpp:4:17: error: array size missing in 'p'
pair<int,int> p[];
^
prog.cpp:5:17: error: variable or field 'qsortfirst' declared void
void qsortfirst(p[],int low,int up){
^
prog.cpp:5:19: error: expected primary-expression before ']' token
void qsortfirst(p[],int low,int up){
^
prog.cpp:5:21: error: expected primary-expression before 'int'
void qsortfirst(p[],int low,int up){
^
prog.cpp:5:29: error: expected primary-expression before 'int'
void qsortfirst(p[],int low,int up){
^