Educational Codeforces Round 30 837A. Chores
来源:互联网 发布:js幻灯片轮播代码 编辑:程序博客网 时间:2024/06/04 19:27
http://codeforces.com/problemset/problem/873/A
Luba has to do n chores today. i-th chore takes ai units of time to complete. It is guaranteed that for every the condition ai ≥ ai - 1 is met, so the sequence is sorted.
Also Luba can work really hard on some chores. She can choose not more than k any chores and do each of them in x units of time instead of ai ().
Luba is very responsible, so she has to do all n chores, and now she wants to know the minimum time she needs to do everything. Luba cannot do two chores simultaneously.
Input
The first line contains three integers n, k, x (1 ≤ k ≤ n ≤ 100, 1 ≤ x ≤ 99) — the number of chores Luba has to do, the number of chores she can do in x units of time, and the number x itself.
The second line contains n integer numbers ai (2 ≤ ai ≤ 100) — the time Luba has to spend to do i-th chore.
It is guaranteed that , and for each ai ≥ ai - 1.
Output
Print one number — minimum time Luba needs to do all n chores.
Examples
input
4 2 2
3 6 7 10
output
13
input
5 2 1
100 100 100 100 100
output
302
Note
In the first example the best option would be to do the third and the fourth chore, spending x = 2 time on each instead of a3 and a4, respectively. Then the answer is 3 + 6 + 2 + 2 = 13.
In the second example Luba can choose any two chores to spend x time on them instead of ai. So the answer is 100·3 + 2·1 = 302.
题意
输入每件工作需要的时间(从短到长),然后可以选k件事用x的时间干完(x比做每一件事用的时间都短),问一共需要多长时间
题解
网上的博客大多由于没读全题,还比较了x和ai的大小,其实题目中已经说明了其关系,送分题,不解释了,直接上代码
CODE
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <cmath>using namespace std;int main(){ int n,k,x; int a; scanf("%d%d%d",&n,&k,&x); int sum=0; for(int i=0;i<n-k;i++) { scanf("%d",&a); sum+=a; } for(int i=0;i<k;i++) { scanf("%d",&a); sum+=x; } cout << sum << endl; return 0;}
- Educational Codeforces Round 30 837A. Chores
- Educational Codeforces Round 30 A. Chore
- Educational Codeforces Round 30(A+B)
- Educational Codeforces Round 5 A
- Educational Codeforces Round 20 A
- Educational Codeforces Round 21 A
- Educational Codeforces Round 23 A
- Educational Codeforces Round 30
- Educational Codeforces Round 30
- Educational Codeforces Round 30
- Educational Codeforces Round 30
- codeforces 873A Chores
- codeforces Educational Codeforces Round 21 A
- Educational Codeforces Round 30 A O(n)算法
- Educational Codeforces Round 30 总结
- Educational Codeforces Round 30 题解
- Educational Codeforces Round 1 A. Tricky Sum
- Educational Codeforces Round 1 (A)模拟
- concurrent-7-AQS-CountDownLatch,CyclicBarrier
- C语言:探测 unsigned int 的边界
- [洛谷P2375]动物园
- fclose函数的一个注意点
- 712. Minimum ASCII Delete Sum for Two Strings
- Educational Codeforces Round 30 837A. Chores
- [安卓]Android Studio 3.0 安装包说明(2017.10)
- 异常解决:Mapped Statements collection does not contain value for …
- 摆动排序 II-LintCode
- 4.1最大子数组问题
- Python 实现不换行打印字符的3种简单方法
- zoj&CCPC秦皇岛站E-思维-String of CCPC
- Reverse Integer
- [LeetCode] 9. Palindrome Number ❤