# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347982 | 2021-01-14T01:44:02 Z | Chaska | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KB |
#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 }