Счетная инверсия [получение неправильного ответа]

---

A file contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated.

Task is to compute the number of inversions in the file given, where the ith row of the file indicates the ith entry of an array.

Что я уже пробовал:

#include<iostream>
#include<vector>
#include<fstream>

using namespace std;

void sort(vector<int>& input1, vector<int>& input2, int& inv) {

int temp=0, j=0, temp2=0, z=0;

for(int k=0; k<input1.size(); k++) {
	while (input1[k] > input1[j+1]) {
		temp = input1[k];
		input1[k] = input1[j+1];
		input1[j+1] = temp;
		inv++;
	}
}

for(int p=0; p<input2.size(); p++) {
	
	while (input2[p] > input2[z+1]) {
		temp2 = input2[p];
		input2[p] = input2[z+1];
		input2[z+1] = temp2;
		inv++;
	}
}

for(int o=0; o<input1.size(); o++) {

		if(input1[o] > input2[o]) {
			inv++;
		}
}

cout << "Total inversions are  " << inv;
};


int main(void) {

int count=0;

vector<int> big;
vector<int> one;
vector<int> two;


ifstream inFile;

inFile.open("w2.txt");

if (!inFile) {
	cout << "Unable to open file datafile.txt";	
}

int value;

while(inFile >> value) {
	big.push_back(value);
}


for(int i=0; i<big.size()/2; i++) {
	one.push_back(big[i]);
}
	
	for(int j=big.size()/2; j<big.size(); j++) {
		two.push_back(big[j]);
	}

sort(one, two, count);

}

---