A10216 | Making a String
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an alphabet consisting of $n$ letters, your task is to make a string of the maximum possible length so that the following conditions are satisfied:
- the $i$ -th letter occurs in the string no more than $a_{i}$ times;
- the number of occurrences of each letter in the string must be distinct for all the letters that occurred in the string at least once.
- the $i$ -th letter occurs in the string no more than $a_{i}$ times;
- the number of occurrences of each letter in the string must be distinct for all the letters that occurred in the string at least once.
输入格式
The first line of the input contains a single integer $n$ ( $2<=n<=26$ ) — the number of letters in the alphabet.
The next line contains $n$ integers $a_{i}$ ( $1<=a_{i}<=10^{9}$ ) — $i$ -th of these integers gives the limitation on the number of occurrences of the $i$ -th character in the string.
The next line contains $n$ integers $a_{i}$ ( $1<=a_{i}<=10^{9}$ ) — $i$ -th of these integers gives the limitation on the number of occurrences of the $i$ -th character in the string.
输出格式
Print a single integer — the maximum length of the string that meets all the requirements.
输入输出样例
输入 #1
3 2 5 5
输出 #1
11
输入 #2
3 1 1 2
输出 #2
3
For convenience let's consider an alphabet consisting of three letters: "a", "b", "c". In the first sample, some of the optimal strings are: "cccaabbccbb", "aabcbcbcbcb". In the second sample some of the optimal strings are: "acc", "cbc".
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted