codeforces——873A —— Chores
来源:互联网 发布:西西软件家园 编辑:程序博客网 时间:2024/05/16 08:25
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.
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.
Print one number — minimum time Luba needs to do all n chores.
4 2 23 6 7 10
13
5 2 1100 100 100 100 100
302
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.
送分,注意一下x值的大小即可。。
#include <iostream>#include <algorithm>#include <cstdio>using namespace std;int main(){ int n,k,x; while(~scanf("%d%d%d",&n,&k,&x)){ int in[108]; for(int i=0;i<n;i++) scanf("%d",&in[i]); sort(in,in+n); int ans=0; for(int i=n-1;i>=n-k;i--) ans+=min(x,in[i]); for(int i=0;i<n-k;i++) ans+=in[i]; cout<<ans<<endl; } return 0;}
- codeforces——873A —— Chores
- codeforces 873A Chores
- poj 1949——Chores
- Educational Codeforces Round 30 837A. Chores
- CF 873 A. Chores【sort】
- Chores
- 【codeforces #3】A——BFS+贪心
- Codeforces —— 359A Table
- codeforces 365A——Good Number
- codeforces——A. Counting Sticks
- codeforces——1A - Theatre Square
- CodeForces—301A—Combination Lock
- codeforces#575A——Fibonotci
- 搜索——Codeforces 763A
- codeforces 804A——Find Amir
- 递推——Codeforces 319A
- CodeForces 698A—Vacations(贪心)
- Educational Codeforces Round 26 A—C
- CSS布局系统
- web功能测试-输入框
- 百度地图调用
- iOS蓝牙开发CoreBluetooth框架总结
- 将 Intent 序列化,像 Uri 一样传递 Intent!!!
- codeforces——873A —— Chores
- AndroidApp混淆
- Centos 7 防火墙配置
- 《构建高性能web站点》读后笔记
- 中小型企业Web开发框架
- 利用编译时注解生成Java源代码
- C#MVC框架一些简单JS的使用
- 圆形头像持续旋转的使用
- Django -- 0x00、Django的安装与相关配置