題目徵集，第二輪 - 题目

#14439. 題目徵集，第二輪

统计

本题由以下用户出题 xiaowuc1 .

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

ICPC 北美資格賽 (NAQ) 的徵題活動已經結束，總共收到了若干題目。評審們對每一道題目的難度進行了投票。今年的 NAQ 將會選用一定數量的題目。NAQ 希望選出的題目能包含盡可能多種不同的難度。請計算出所能達到的最大不同難度數量。

輸入格式

輸入的第一行包含兩個整數 $n$ 和 $k$ ($1 \le k \le n \le 50$)。NAQ 將會從 $n$ 道候選題目中精確選出 $k$ 道題目。

接下來的 $n$ 行，每行包含一個整數 $d$ ($1 \le d \le 50$)，代表這 $n$ 道候選題目的難度。

輸出格式

輸出一個整數，代表 NAQ 可以選出的題目中，所能包含的最大不同難度數量。

範例

輸入 1

輸出 1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0