Final Standings

Final Standings

题意：有n个车手在比赛，其中前k个车手的总得分为p，且只有d个不同的分数，问最终n位车手的排名
解法：贪心，k以后的选手可以为0，所以直接贪心就好

#include <iostream>
using namespace std;
#include <stdio.h>
int f[1000];

int main() {
    freopen("final.in","r",stdin);
    freopen("final.out","w",stdout);

    int n, p, k, d;
    cin >> n >> p >> k >> d;
    if (d == 1) {
        if (p%k == 0) {
            for (int i = 1; i <= k; i++)
                f[i] = p/k;
        } else {
            if ((n == k) || (p/k == 0) || ((p%k)/(n-k) > (p/k))) {
                cout << "Wrong information" << endl;
                fclose(stdin);
                fclose(stdout);
                return 0;
            }
            for (int i = 1; i <= k; i++) f[i] = p/k;
            int sum = p%k;
            for (int i = k+1; i <= n; i++) {
                f[i] = f[i-1];
                sum = sum-f[i];
                if (sum < 0) {
                    f[i] += sum;
                    break;
                }
            }
        }
        for (int i = 1; i <= n; i++)
            cout << f[i] << endl;
        fclose(stdin);
        fclose(stdout);
        return 0;
    }

    int sum = 0;
    for (int i = 1; i <= d; i++) {
        f[i] = d-i;
        sum += f[i];
    }
    if (sum > p) {
        cout << "Wrong information" << endl;
        return 0;
    }
    f[1] += p-sum;
    for (int i = 1; i <= n; i++)
        cout << f[i] << endl;


    fclose(stdin);
    fclose(stdout);
}