uva11039 -Building designing

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

const int N = 500005;
int arr
;

int cmp(int a, int b){
return abs(a)<abs(b);
}
int main() {
int cas;
scanf("%d", &cas);
while (cas--){
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
sort(arr, arr + n, cmp);
int ans = 1, t;
if (arr[0]<0)
t = -1;
else
t = 1;
for (int i = 1; i < n; i++){
if (arr[i] * t<0){
ans++;
t = -t;
}
}
printf("%d\n", ans);

}
}