# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650146 | activedeltorre | 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 <vector>
using namespace std;
long long count_swaps(vector<int>vec)
{
long long n=vec.size();
int cnt=0;
int suma=0;
for(i=0;i<n;i++)
{
if(v[i]<0)
{
suma=suma+i-cnt;
cnt=cnt+2;
}
}
return suma;
}