# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154343 | BlackBull | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
int m; m=2*n;
vector<int> S(m);
for(int i=0;i<m;i++)
{
cin >> S[i];
}
if(S[0]<S[1]){
int a;a=0;
cout << a;
}
else
{
int b;b=1;
cout << b;
}
return 0;
}