codeforces 34B Sale

最新推荐文章于 2020-10-25 16:40:13 发布

原创最新推荐文章于 2020-10-25 16:40:13 发布 · 910 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces #sort #greed

ACM算法_贪心专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个关于贪心算法的应用案例，通过选取最有利的物品来最大化收益。该问题涉及排序与简单遍历，旨在挑选出性价比最高的电视进行购买以获取最大利润。

点击打开链接

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.

Input

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

Output the only number — the maximum sum of money that Bob can earn, given that he can carry at most m TV sets.

   Examples
 
     input 
    
      Copy
    
5 3
-6 0 35 -2 4

     output 
    
      Copy
    
8

     input 
    
      Copy
    
4 2
7 0 0 -7

     output 
    
      Copy
    
7

典型的贪心

#include<bits/stdc++.h>  
using namespace std;  
typedef long long ll;  
const int inf = 0x3f3f3f3f;  
int main()   
{  
	// freopen("shuju.txt","r",stdin);
    int n,m;
    cin>>n>>m;  
    int a[110];
    for(int i=0;i<n;i++)
    {
    	cin>>a[i];
    }
    sort(a,a+n);
    int ans=0;
    for(int i=0;i<m;i++)
    {
    	if(a[i]>=0)
    		break;
    	else
    		ans-=a[i];
    }
    cout<<ans<<endl;
    return 0;  
}