\author{Problem Author: Nick Wu}
\newcommand{\callforproblemsroundheader}{Problem C: Call for Problems, Round 2}

\begin{frame}{\callforproblemsroundheader{}}
  \begin{block}{Problem}
    \begin{itemize}
      \item Given $n$ integers, find a subset of $k$ of them with the
      maximum number of distinct integers.
    \end{itemize}        
  \end{block}
\end{frame}
\begin{frame}{\callforproblemsroundheader{}}
  \begin{block}{Solution}
    \begin{itemize}
      \item If there are at least $k$ distinct integers among the $n$
      present, then the answer is $k$.
      \item Otherwise. the answer is the number of distinct integers
      present.
    \end{itemize}        
  \end{block}
\end{frame}
