Pagini recente » Cod sursa (job #1750230) | Cod sursa (job #1755233) | Cod sursa (job #1903353) | Cod sursa (job #1203598) | Cod sursa (job #1758881)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
class InputReader {
public:
InputReader() {}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(long long &n) {
while(buffer[cursor] < '0' || buffer[cursor] > '9') {
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
};
InputReader cin("caramizi.in");
ofstream cout("caramizi.out");
const int MAXN = 200000;
const int MAXVAL = 1000000;
long long v[1 + MAXN + 1];
long long dp[1 + MAXVAL], height[1 + MAXVAL];
int main() {
long long n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> v[i];
sort(v + 1, v + n + 1);
v[0] = 1;
v[n + 1] = MAXVAL + 1;
long long sum = 0;
for (int i = 0; i <= n; i++) {
if (i)
sum += v[i];
for (int j = v[i]; j < v[i + 1]; j++)
dp[j] = max(sum - sum % j + (n - i) * j, dp[j - 1]);
}
for (int i = sum / v[n]; i; i--)
height[i] = max(sum - sum % i, height[i + 1]);
for (int i = 1; i <= m; i++) {
long long limit;
cin >> limit;
if (limit < MAXVAL)
cout << dp[limit] << "\n";
else
cout << height[sum / limit + 1] << "\n";
}
return 0;
}