CodeForces 462B Appleman and Card Game(贪心)
2016-02-20 14:11
453 查看
题目链接: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
output
input
output
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:
贪心。从牌数多的面值開始选。
代码例如以下:
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\n",ans); } return 0; }
相关文章推荐
- Android之线程安全的单例模式,Adapter注意事项之引用传值
- 从 Android 静音看正确的查找 bug 的姿势
- Android的IPC机制(一)——AIDL的使用
- Android小程序总结
- php微信接口验证写法
- 浅析Android的窗口
- Android内存泄露之Context
- iOS开发规范
- Android录制WAV文件
- 【Xamarin 挖墙脚系列:IOS 开发界面的3种方式】
- 基于Android arm64 可执行程序的编译运行
- iOS 项目目录结构
- 微信开发踩坑之旅 之 自动回复功能
- JSBadgeView适配iOS7、8,和超快速使用
- Android学习路线(六)为Android应用加入ActionBar
- android 成长日记 4.BaseActivity的实现和ActivityCollectio实现
- Unity3D中的坐标系
- iOSMonkeyKingTest
- 在BIOS中如何更改启动顺序
- iOS: 适配启动图和图标