pintia提交后显示浮点错误

#include<algorithm>
#include <iostream>
using namespace std;
int main()
{
int N,n, BOOL = 0, i, j;
cin >> N;
n = N;
int a[100], b[100], c[100];
for (i = 0; i < N; i++) {
	cin >> a[i];
	c[i] = a[i];
}
for (i = 0; i < N; i++) {
	cin >> b[i];
}
for (i = 0; i < N; i++) {
	if (b[i] < b[i - 1]) {
		break;
	}
}
for (; i < N; i++) {
	if (a[i] != b[i])
		BOOL++;
}
if (BOOL == 0) {
	cout << "Insertion Sort" << endl;
	for (i = 1; i < N; i++)//循环从第2个元素开始
	{
		if (a[i] < a[i - 1])
		{
			int temp = a[i];
			for (j = i - 1; j >= 0 && a[j] > temp; j--)
			{
				a[j + 1] = a[j];
			}
			a[j + 1] = temp;
		}
		BOOL = 0;
		for (int k = 0; k < N; k++)
			if (a[k] != b[k])
				BOOL++;
		if (!BOOL)
			break;

	}
	i++;
	if (a[i] < a[i - 1])
	{
		int temp = a[i];
		for (j = i - 1; j >= 0 && a[j] > temp; j--)
		{
			a[j + 1] = a[j];
		}
		a[j + 1] = temp;
	}
	for (i = 0; i < N - 1; i++) {
		cout << a[i] << " ";
	}
	cout << a[N - 1];

}
else {
	cout << "Merge Sort" << endl;
	int k = 1, flag = 1;
	while (flag)
	{
		flag = 0;
		for (i = 0; i < n; i++)
		{
			if (c[i] != b[i])
			{
				flag = 1;
				break;
			}
		}
		k *= 2;
		for (i = 0; i < n / k; i++)
			sort(c + i * k, c + (i + 1)*k);
		sort(c + k * (n / k), c + n);
	}
	for (i = 0; i < n - 1; i++)
	{
		cout << c[i] << " ";
	}
	cout << c[n - 1];

}


return 0;
}

代码如下，希望各位大神帮我找出错误，不胜感激。