1397B - Power Sequence - CodeForces Solution

#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_map>
#define endl '\n'
using namespace std;
#define int long long
typedef pair<int, int>pii;
const int mod = 998244353;
const int N = 1e5 + 10;
int ans = 1e18;
int a[N];
signed main()
{
    ios::sync_with_stdio(0); cout.tie(0); cin.tie(0);

    int sum = 0;
    int n; cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    sort(a + 1, a + 1 + n);
    int sum0 = 0;
    for (int i = 1; i <= n; i++)
    {
        sum0 += abs(a[i] - 1);
    }
    ans = sum0;
    for (int i = 2; ; i++)
    {
        int sum1 = 0, p = 1;
        for (int j = 1; j <= n; j++)
        {
            sum1 += abs(a[j] - p);
            p *= i;
            if (sum1 > 1e15)break;
        }
        if (sum1 > 1e15)break;
        if (ans < sum1)
        {
            break;
        }
        else ans = sum1;
    }
    cout << ans << endl;
    return 0;
}