#include "shoes.h" #include <cmath> long long count_swaps(std::vector<int> s) { const int n = s.size(); int ans = 0; for (int i = 0; i < n; ++i) { int j; for (j = i + 1; abs(s[j]) != abs(s[i]); ++j) { if (s[j] != 0) { ++ans; } } if (s[i] > 0) { ++ans; } s[i] = s[j] = 0; } return ans; }