Wannafly挑战赛13-D

题解：看到大佬的写的结构体，骤然醒悟，一块蛋糕切k次，这(k+1)块蛋糕是均匀的。所以要保存切的次数，及其对应的蛋糕大小(切了几次后的蛋糕大小)，初始蛋糕的大小。

感受：以前理解的是切蛋糕是均分的，切k次每块大小为Cake/(2^k)。正解是切k次每块大小为Cake/k。

#pragma warning(disable:4996)
#include<queue>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long 
using namespace std;

const double INF = 1e9 + 7;

struct node {
    double a, b;
    int num;
    node() {};
    node(double a, double b, int num) :a(a), b(b), num(num) {}
    bool operator<(const node& i) const {
        return b < i.b;
    }
};

int n;
double ratio;

int main()
{
    while (cin >> ratio >> n) {
        priority_queue<node> p;

        double Min = INF;
        for (int i = 1; i <= n; i++) {
            double tp;
            cin >> tp;
            Min = min(Min, tp);
            p.push(node(tp, tp, 1));
        }

        int ans = 0;
        while (true) {
            node now = p.top(); p.pop();
            
            if (Min / now.b >= ratio) break;

            ans++;
            now.num++;

            now.b = now.a / now.num;
            p.push(now);

            Min = min(Min, now.b);
        }

        cout << ans << endl;
        
    }
    return 0;
}