Appleman and Card Game CodeForces - 462B (贪心)

Appleman and Card Game

CodeForces - 462B

Appleman has n cards. Each card has an uppercase letter written on it. Toastman must choose k cards from Appleman's cards. Then Appleman should give Toastman some coins depending on the chosen cards. Formally, for each Toastman's card i you should calculate how much Toastman's cards have the letter equal to letter on ith, then sum up all these quantities, such a number of coins Appleman should give to Toastman.

Given the description of Appleman's cards. What is the maximum number of coins Toastman can get?

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 105). The next line contains n uppercase letters without spaces — the i-th letter describes the i-th card of the Appleman.

Output

Print a single integer – the answer to the problem.

Example
Input
15 10
DZFDFZDFDDDDDDF
Output
82
Input
6 4
YJSNPI
Output
4
Note

In the first test example Toastman can choose nine cards with letter D and one additional card with any letter. For each card with D he will get 9 coins and for the additional card he will get 1 coin.

贪心,直接储存下每种字母出现的次数,每次都选取出现次数最多的,次数的平方就是每次可以得到的钱

code:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
long long n,k;
char s[100010];
long long num[100];
bool cmp(long long a,long long b){
    return a > b;
}
int main(){
    scanf("%lld%lld",&n,&k);
    scanf("%s",s);
    int i;
    memset(num,0,sizeof(num));
    for(i = 0; i < n; i++){
        num[s[i]-'A']++;
    }
    sort(num,num+26,cmp);
    long long ans = 0;
    for(i = 0; i < 26; i++){
        if(num[i]<=k){
            ans = ans+(num[i]*num[i]);
            k -= num[i];
        }
        else{
            ans = ans + k*k;
            k  =0;
        }
        if(!k)break;
    }
    printf("%lld\n",ans);
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值