Counting ones

#include <iostream>
#include <vector>
#include <cmath>
#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long n_values;
    cin >> n_values;

    vector<long long> values;

    for(int i = 0; i < n_values; ++i)
    {
        long long temp;
        cin >> temp;
        values.push_back(temp);
    }
    
    int max_ones = 0;
    long long val1 = 0;
    long long val2 = 0;

    for (int i = 0; i < n_values - 1; ++i)
    {
        for (int j = i + 1; j < n_values; ++j)
        {
            long long val = values[j] * values[i];
            if(__builtin_popcount(val) > max_ones)
            {
                max_ones = __builtin_popcount(val);
                val1 = values[i];
                val2 = values[j];
            }
            
        }
    }

    cout << max_ones << endl;
    cout << val1 << " " << val2 << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

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