greedy number theory *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=1e6+5;
int n,a[maxn],anss,sum=0;
int ans=0x3f3f3f3f;
signed main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],sum+=a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(i==1){
            for(int j=1;j<=a[i];j++){
                if(a[i]%j==0){
                    ans=min(ans,sum-a[i]-a[2]+a[i]/j+a[2]*j);
                }
            }
        }
        else {
            for(int j=1;j<=a[i];j++){
                if(a[i]%j==0){
                    ans=min(ans,sum-a[1]-a[i]+a[i]/j+a[1]*j);
                }
            }
        }
    }
    cout<<ans;
}


Comments

Submit
0 Comments
More Questions

1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals