ACM学习历程—Hihocoder 1288 Font Size（暴力 || 二分）

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <string>
#define LL long long

using namespace std;

int n, w, h, p;
int a[1005];

void input()
{
    scanf("%d%d%d%d", &n, &p, &w, &h);
    for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
}

bool judge(int s)
{
    int all = p*(h/s), sum = 0, k = w/s;
    for (int i = 0; i < n; ++i)
        sum += a[i]%k ? a[i]/k+1 : a[i]/k;
    if (sum <= all) return true;
    else return false;
}

void work()
{
    int len = min(w, h);
    for (int s = len; s >= 0; --s)
    {
        if (judge(s))
        {
            printf("%d\n", s);
            return;
        }
    }
}

int main()
{
    //freopen("test.in", "r", stdin);
    int T;
    scanf("%d", &T);
    for (int times = 1; times <= T; ++times)
    {
        input();
        work();
    }
    return 0;
}