A7934 | Towers
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.
Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.
Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.
输入格式
The first line contains an integer $N$ ( $1<=N<=1000$ ) — the number of bars at Vasya’s disposal. The second line contains $N$ space-separated integers $l_{i}$ — the lengths of the bars. All the lengths are natural numbers not exceeding $1000$ .
输出格式
In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.
输入输出样例
输入 #1
3 1 2 3
输出 #1
1 3
输入 #2
4 6 5 6 7
输出 #2
2 3
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted