Codeforces Round #539--1113B - Sasha and Magnetic Machines

#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> num;
vector<int> isPrime(int d){
    vector<int> res;
    for(int i=1;i*i<=d;i++){
        if(d%i==0){
            res.push_back(i);
            if(i!=d/i)
                res.push_back(d/i);
        }
    }
    return res;
}
int main(){
    cin>>n;
    num.resize(n);
    for(int i=0;i<n;i++)
        cin>>num[i];
    int sum=accumulate(num.begin(),num.end(),0);
    int minNum=*min_element(num.begin(),num.end());
    int ress=sum;
    for(int i=0;i<num.size();i++){
        vector<int> res=isPrime(num[i]);
        for(int j=0;j<res.size();j++){
            int c=res[j];
            int tmpSum=sum-minNum-num[i];
            tmpSum+=minNum*c+num[i]/c;
            ress=min(ress,tmpSum);
        }    
    }
    cout<<ress<<endl;
    return 0;
}