zoukankan      html  css  js  c++  java
  • Codeforces Round #435 A. Mahmoud and Ehab and the MEX

    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Dr. Evil kidnapped Mahmoud and Ehab in the evil land because of their performance in the Evil Olympiad in Informatics (EOI). He decided to give them some problems to let them go.

    Dr. Evil is interested in sets, He has a set of n integers. Dr. Evil calls a set of integers evil if the MEX of it is exactly x. the MEX of a set of integers is the minimum non-negative integer that doesn’t exist in it. For example, the MEX of the set {0, 2, 4} is 1 and the MEX of the set {1, 2, 3} is 0 .

    Dr. Evil is going to make his set evil. To do this he can perform some operations. During each operation he can add some non-negative integer to his set or erase some element from it. What is the minimal number of operations Dr. Evil has to perform to make his set evil?
    Input

    The first line contains two integers n and x (1 ≤ n ≤ 100, 0 ≤ x ≤ 100) — the size of the set Dr. Evil owns, and the desired MEX.

    The second line contains n distinct non-negative integers not exceeding 100 that represent the set.
    Output

    The only line should contain one integer — the minimal number of operations Dr. Evil should perform.
    Examples
    Input

    5 3
    0 4 5 6 7

    Output

    2

    Input

    1 0
    0

    Output

    1

    Input

    5 0
    1 2 3 4 5

    Output

    0

    Note

    For the first test case Dr. Evil should add 1 and 2 to the set performing 2 operations.

    For the second test case Dr. Evil should erase 0 from the set. After that, the set becomes empty, so the MEX of it is 0.

    In the third test case the set is already evil.

    思路:
    桶排序。

    代码:

    #include <cstdio>
    #include <iostream>
    
    using namespace std;
    
    int board[105];
    
    int main(){
        int N,X;
        cin>>N>>X;
        for(int i=0 ; i<N ; i++){
            int mid;
            cin>>mid;
            board[mid] = 1;
        }
        int result = 0;
        for(int i=0 ; i<X ; i++){
            if(board[i] == 0)result++;
        }
        if(board[X])result++;
        cout<<result<<endl;
    
        return 0;
    }
    
  • 相关阅读:
    Spark2.4.5集群安装与本地开发
    Windows玩转Kubernetes系列4-搭建K8S Dashboard
    Windows玩转Kubernetes系列3-Centos安装K8S
    Windows玩转Kubernetes系列2-Centos安装Docker
    Windows玩转Kubernetes系列1-VirtualBox安装Centos
    Lock wait timeout exceeded?代码该优化了
    RocketMQ初入门踩坑记
    Java8虚拟机(JVM)内存溢出实战
    CentOS 7 下 JDK1.8+Maven+Nginx+MySql+Git+Redis环境安装
    消息中间件—SpringBoot下RabbitMQ实战
  • 原文地址:https://www.cnblogs.com/vocaloid01/p/9514255.html
Copyright © 2011-2022 走看看