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

struct Node {
    int i;
    char ch;
};

//Custom comparator 
bool cmp (const Node &a, const Node &b){
    return a.i < b.i;
}

void printArr (Node *a, int N) {
	
	for (int i=0; i<N; i++) {
	  cout<<a[i].i<<" "<<a[i].ch<<endl;
	}
	
}

int main() {

	int N = 3;
	
	Node a[N];
	a[0].i = 2;
	a[0].ch = 'b';
	a[1].i = 1;
	a[1].ch = 'a';
	a[2].i = 3;
	a[2].ch = 'c';
	
	cout<<"Array before sorting:"<<endl;
	printArr(a, N);
	
	sort(a, a+N, &cmp);
	
	cout<<"Array after sorting:"<<endl;
	printArr(a, N);

	return 0;
}