zoukankan      html  css  js  c++  java
  • CodeForces 462B Appleman and Card Game(贪心)

    题目链接:http://codeforces.com/problemset/problem/462/B


    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.

    Sample test(s)
    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.


    题意:

    共同拥有N张牌,从中选出K张,得分为每次选出牌的面值与选该牌的数量。求最大得分。


    PS:

    贪心。从牌数多的面值開始选。



    代码例如以下:

    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    typedef __int64 LL;
    int main()
    {
        LL n, k;
        LL a[47];
        char s[100017];
        while(~scanf("%I64d%I64d",&n,&k))
        {
            memset(a,0,sizeof(a));
            scanf("%s",s);
            for(int i = 0; i < n; i++)
            {
                a[s[i]-'A']++;
            }
            sort(a,a+26);
            LL ans = 0;
            for(int i = 25; i >= 0; i--)
            {
                if(k >= a[i])
                {
                    ans+=a[i]*a[i];
                    k -= a[i];
                    if(k == 0)
                        break;
                }
                else
                {
                    ans+=k*k;
                    break;
                }
            }
            printf("%I64d
    ",ans);
        }
        return 0;
    }
    


  • 相关阅读:
    Java8 Lambda表达式详解手册及实例
    成功,侥幸,以小博大?永远离不开的墨菲定律
    Java8 Stream性能如何及评测工具推荐
    康威定律,作为架构师还不会灵活运用?
    Java8 Stream新特性详解及实战
    Java SPI机制实战详解及源码分析
    jQuery是什么
    庞氏骗局
    excel中VBA的使用
    wcf ServiceContract
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5203192.html
Copyright © 2011-2022 走看看