Submission

Score: 80

User: Surachate

Problemset: วิศวกรรมข้อมูล

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-12 18:20:13

#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

string toBinary(int a) {
    if (a < 2) {
        return to_string(a);
    } else {
        return toBinary(a/2) + to_string(a%2);
    }
}

int todefault(string binarytext) {

    int k = 1;

    int sum = 0;
    int l = binarytext.length();

    for (char x : binarytext) {
        sum += (x-'0')*pow(2,l-k);
        k += 1;
    }

    return sum;
}

int main() {

    int n; cin >> n;

    int arr[n];
    string biarr[n];

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

        biarr[i] = toBinary(arr[i]);
    }

    sort(biarr,biarr+n,[](string a, string b) {
        int aOne = count(a.begin(),a.end(),'1');
        int bOne = count(b.begin(),b.end(),'1');

        int az = count(a.begin(),a.end(),'0');
        int bz = count(b.begin(),b.end(),'0');

        if (aOne != bOne) {
            return aOne > bOne;
        }

        if (az != bz) {
            return az < bz;
        }

        return true;
    });

    string bitex = "";

    for (int i = 0; i < n; i++) {
        bitex += biarr[i];
    }

    cout << todefault(bitex) << endl;
    
    



    return 0;
}