Counting ones

#include <iostream>
#include <vector>
#include <cstdint>
#include <utility>
#include <algorithm>

int main() {
    int n;
    std::cin >> n;

    std::vector<uint64_t> values(n);
    for (auto &v : values) {
        std::cin >> v;
    }
    std::sort(values.begin(), values.end(), [](auto &a, auto &b) {
        return __builtin_popcount(a) > __builtin_popcount(b);
    });

    std::cout << __builtin_popcount(values[0]*values[1]) << "\n" << values[0] << " " << values[1] << std::endl;
}

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