#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n;
cin>>n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
vector<char> a1(n,'0'),b1(n,'0');
int p1=0,p2=0;
//k=0
for(int i=0;i<n;i++){
if(a[p1]<b[p2]){
a1[p1]='1';
p1++;
}
else{
b1[p2]='1';
p2++;
}
}
//k=n/2
for(int i=1;2*i<=n;i++){
a1[i-1]='1';
b1[i-1]='1';
}
for(auto it:a1){
cout<<it;
}
cout<<endl;
for(auto it:b1){
cout<<it;
}
cout<<endl;
}
int32_t main()
{
int tc=1;
// cin>>tc;
while(tc--){
solve();
}
return 0;
}
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |