Pagini recente » Cod sursa (job #414449) | Cod sursa (job #2855940) | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #2087602)
#include<bits/stdc++.h>
using namespace std;
ifstream f("caramizi.in");
ofstream g("caramizi.out");
int n,m;
int frq[1000002];
int v[200002];
long long s,max1[1000002],ct;
int main()
{
f>>n>>m;
for(int i=1;i<=n;++i)
f>>v[i],frq[v[i]]++;
ct=0;
for(long long i=1;i<=v[n];++i)
{
max1[i]=max1[i-1];
ct+=frq[i-1];
s+=1ll*frq[i-1]*(i-1);
max1[i]=max(max1[i],1ll*(n-ct)*i+s-s%i);
}
s+=1ll*frq[v[n]]*v[n];
for(long long i=v[n]+1;i<=1000000;++i)
max1[i]=max(max1[i-1],s-s%i);
for(int i=1;i<=m;++i)
{
int nr;
f>>nr;
if(nr<=1000000)
g<<max1[nr]<<'\n';
else
g<<max1[1000000]<<'\n';
}
return 0;
}