# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347982 | Chaska | Arranging Shoes (IOI19_shoes) | C++17 | 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 "shoes.h"
#include <bits/stdc++.h>
using namespace std;
int n;
long long count_swaps(vector<int> s) {
n = s.size()/2;
int p =0;
long long k=0;
for (int i=0;i<n+n;i++) {
if (s[i]<0) {
k += i-p;
p++;
}
}
return k
}