关闭

CodeForces 540B School Marks

178人阅读 评论(0) 收藏 举报
分类:

http://codeforces.com/problemset/problem/540/B

 School Marks

Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't want to stand out from the crowd too much. If the sum of his marks for all tests exceeds value x, then his classmates notice how smart he is and start distracting him asking to let them copy his homework. And if the median of his marks will be lower than y points (the definition of a median is given in the notes), then his mom will decide that he gets too many bad marks and forbid him to play computer games.

Vova has already wrote k tests and got marks a1, ..., ak. He doesn't want to get into the first or the second situation described above and now he needs to determine which marks he needs to get for the remaining tests. Help him do that.

Input

The first line contains 5 space-separated integers: nkpx and y (1 ≤ n ≤ 999n is odd, 0 ≤ k < n1 ≤ p ≤ 1000n ≤ x ≤ n·p,1 ≤ y ≤ p). Here n is the number of tests that Vova is planned to write, k is the number of tests he has already written, p is the maximum possible mark for a test, x is the maximum total number of points so that the classmates don't yet disturb Vova, y is the minimum median point so that mom still lets him play computer games.

The second line contains k space-separated integers: a1, ..., ak (1 ≤ ai ≤ p) — the marks that Vova got for the tests he has already written.

Output

If Vova cannot achieve the desired result, print "-1".

Otherwise, print n - k space-separated integers — the marks that Vova should get for the remaining tests. If there are multiple possible solutions, print any of them.

Sample test(s)
input
5 3 5 18 4
3 5 4
output
4 1
input
5 3 5 16 4
5 5 5
output
-1
Note

The median of sequence a1, ..., an where n is odd (in this problem n is always odd) is the element staying on (n + 1) / 2 position in the sorted list of ai.

In the first sample the sum of marks equals 3 + 5 + 4 + 4 + 1 = 17, what doesn't exceed 18, that means that Vova won't be disturbed by his classmates. And the median point of the sequence {1, 3, 4, 4, 5} equals to 4, that isn't less than 4, so his mom lets him play computer games.

Please note that you do not have to maximize the sum of marks or the median mark. Any of the answers: "4 2", "2 4", "5 1", "1 5", "4 1", "1 4" for the first test is correct.

In the second sample Vova got three '5' marks, so even if he gets two '1' marks, the sum of marks will be 17, that is more than the required value of 16. So, the answer to this test is "-1".


题意

有一个人,需要考n科,已经考了k科,他需要他的n科分数和不大于x,中位数不小于y

然后让你构造出一个可行解

题解:

把剩下的n-k科全部置为y,如果不行,就置为1

#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cstdio>

using namespace std;

#define N 1310
#define INF 0x3f3f3f3f
#define met(a, b) memset (a, b, sizeof (a))

int main ()
{
    int n, k, p, x, y, val1[N], val2[N];

    while (scanf ("%d%d%d%d%d", &n, &k, &p, &x, &y) != EOF)
    {
        int sum = 0;
        met (val1, 0);
        met (val2, 0);

        for (int i=1; i<=k; i++)
        {
            scanf ("%d", &val1[i]);
            sum += val1[i];
        }

        int m = n-k, j = 0;

        while (m)
        {
            if (sum+y<=x && x-(sum+y)>=m-1)
            {
                val1[++k] = y;
                val2[j++] = y;
                sum += y;
            }
            else
            {
                val1[++k] = 1;
                val2[j++] = 1;
                sum++;
            }

            m--;
        }

        sort (val1+1, val1+n+1);

        if (val1[(n+1)/2]<y || sum>x)
        {
            puts ("-1");
            continue;
        }

        for (int i=0; i<j-1; i++)
            printf ("%d ", val2[i]);
        printf ("%d\n", val2[j-1]);
    }
    return 0;
}


1
0
查看评论

Codeforces 540B - School Marks (思维)

RT
  • u014247806
  • u014247806
  • 2015-05-01 10:54
  • 673

CodeForces 540B School Marks (贪心)

题意:Vova有n个学习任务,他现在完成了k个,每完成一个任务他会给这个任务一个得分,得分范围是1~p 现在你的任务是帮助他确定剩下的任务得分多少可以使得所有任务的得分综合不大于x并且得分非递减序列的中位数不小于y 我的思路是统计当前完成的k个任务中得分比y小的任务的个数和不小于y的任务的个数,而后...
  • KuHuaiShuXia
  • KuHuaiShuXia
  • 2016-07-25 09:00
  • 253

Codeforces 540B School Marks

#include<iostream> #include<cstdio> #include<string> #include<cstring> #include<string.h> #include<algorithm>using...
  • minglotus
  • minglotus
  • 2015-05-01 18:12
  • 155

CodeForces - 540B School Marks

B. School Marks time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ...
  • yjt9299
  • yjt9299
  • 2017-09-21 10:53
  • 65

Codeforces 540B - School Marks

Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they wil...
  • rikkatheworld
  • rikkatheworld
  • 2016-07-22 20:06
  • 191

codeforces 540B School Marks

B. School Marks time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ...
  • wyjwyl
  • wyjwyl
  • 2016-03-08 16:31
  • 226

School Marks CodeForces - 540B

题意: n个数字,已经给定k个,数字大小规定从1~P,和不可以超过x,中位数不低于y,求补全的数字 思路: 中位数小了就填y,大了就填1 #include #include #include #include #include int...
  • qq_33951440
  • qq_33951440
  • 2016-12-17 14:18
  • 157

Codeforces 540B - School Marks (贪心)

第一次在CF上水题,  果断wa了好几发,   纪念一下,一发水题。 题意:有N门成绩,   已经告知你K门, 在保证N门总和小于X且中位数大于Y的情况,  让你求出剩下N-K门, 题解: 明显 要保证和越小越好,  插入的数字只有1和Y,在插...
  • q651111937
  • q651111937
  • 2015-05-20 12:27
  • 499

CodeForces - 540B School Marks (构造)

题目链接:http://codeforces.com/problemset/problem/540/B点击打开链接 B. School Marks time limit per test 2 seconds memory limit per tes...
  • xuejye
  • xuejye
  • 2018-01-08 21:28
  • 30

CodeForces - 540B School Marks (数学思维题 中位数)

CodeForces - 540B School Marks Time Limit: 2000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u Subm...
  • yanghui07216
  • yanghui07216
  • 2016-03-05 22:12
  • 628
    个人资料
    • 访问:80422次
    • 积分:3566
    • 等级:
    • 排名:第10992名
    • 原创:277篇
    • 转载:6篇
    • 译文:0篇
    • 评论:17条
    最新评论