# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
204330 | ADJA | 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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;
const int MAXN = 105000;
long long count_swaps(int S[]) {
int result = 0;
if (S[0] > 0) {
result++;
}
return result;
}
int n;
int s[MAXN];
int main() {
cin >> n;
for (int i = 0; i < 2 * n; i++) {
scanf("%d", &s[i]);
}
cout << count_swaps(s) << endl;
}