Counting ones

#include <iostream>
#include <vector>

using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define FAST                                                                   \
    ios::sync_with_stdio(0);                                                   \
    cin.tie(0);

int main() {
    FAST;

    int n;
    cin >> n;
    vi arr = vi(n);
    for (int i = 0; i < n; i++)
        cin >> arr[i];

    pi bestP = {-1, -1};
    int best = -1;

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            int score = __builtin_popcount(arr[i] * arr[j]);
            if (score > best) {
                best = score;
                bestP.first = arr[i];
                bestP.second = arr[j];
            }
        }
    }

    cout << bestP.first << " " << bestP.second;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER