Codeforces 34B-Sale(暴力)
来源:互联网 发布:在家赚钱 知乎 编辑:程序博客网 时间:2024/06/07 09:08
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV sets he wants. Though he's very strong, Bob can carry at most m TV sets, and he has no desire to go to the sale for the second time. Please, help Bob find out the maximum sum of money that he can earn.
The first line contains two space-separated integers n and m (1 ≤ m ≤ n ≤ 100) — amount of TV sets at the sale, and amount of TV sets that Bob can carry. The following line contains n space-separated integers ai ( - 1000 ≤ ai ≤ 1000) — prices of the TV sets.
Output the only number — the maximum sum of money that Bob can earn, given that he can carry at most m TV sets.
5 3-6 0 35 -2 4
8
4 27 0 0 -7
7
也是水题。。
题意: n件物品,价值有正有负,最多买m件,求最多能赚多少钱。
直接排序,只取负值,最多取m个
#include <algorithm>#include <iostream>#include <cstring>#include <cstdlib>#include <string>#include <cctype>#include <vector>#include <cstdio>#include <cmath>#include <deque>#include <stack>#include <map>#include <set>#define ll long long#define maxn 116#define pp pair<int,int>#define INF 0x3f3f3f3f#define max(x,y) ( ((x) > (y)) ? (x) : (y) )#define min(x,y) ( ((x) > (y)) ? (y) : (x) )using namespace std;int n,m,a[102];int main(){ while(scanf("%d%d",&n,&m)!=EOF){for(int i=0;i<n;i++)scanf("%d",a+i);;sort(a,a+n);int ans=0,cnt=0;for(int i=0;i<n;i++)if(a[i]<0&&cnt<m){ans+=a[i];cnt++;}elsebreak;printf("%d\n",-ans);}return 0;}
- Codeforces 34B-Sale(暴力)
- CodeForces 34B Sale
- CodeForces 34B Sale
- CODEFORCES, 34B Sale
- codeforces-34B-B. Sale( C++ && greedy && sortings )
- Codeforces 779B(暴力)
- Codeforces 332B Maximum Absurdity(暴力)
- 【CodeForces】651B - Beautiful Paintings(暴力)
- CodeForces 699B One Bomb(暴力)
- 【CodeForces 707B】Bakery(暴力)
- Codeforces 550B 【暴力】
- CodeForces 665B【暴力】
- CodeForces 66B 暴力
- codeforces 903B(暴力)
- CodeForces 626B CodeForces 626B【暴力】
- B. Sale
- Codeforces 479B Towers(暴力)
- Codeforces 479B. Towers 暴力
- 题目1076:N的阶乘
- 作业2
- 常见的9种内部排序(C语言实现)
- Win95+IE3 – Win10+IE11全版本执行漏洞(含POC)
- Qt4.8.6+mingw+Qgis2.4.0基于QGis的二次开发
- Codeforces 34B-Sale(暴力)
- ZOJ-3291-Never End
- Android:Failed to install UIWidgetTest.apk on device 'emulator-5554': timeout
- Android 单独开启线程处理服务器数据提交和访问
- Redis缓存加速
- 链表
- 猜大小游戏
- Java I/O操作汇总
- 一个可以说话的人