Counting ones

#include <bits/stdc++.h>
using namespace std;

int main() {
    std::ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> v(n);
    for (int& t : v) cin >> t;
    sort(v.begin(), v.end());
    int h = 0, k = 0;
    int currMax = 0, max = -67;
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            long long t = v[i] * v[j];
            // bitset<256> bt(t);
            currMax = __builtin_popcountll(t);
            if (currMax >= max) {
                max = currMax;
                h = v[i];
                k = v[j];
            }
            currMax = 0;
        }
    }
    cout << max << '\n' << h << ' ' << k;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

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