implementation *900

Please click on ads to support us..

Python Code:

for p in range(int(input())):
    n,x=map(int,input().split())
    a=list(map(int,input().split()))
    i=1
    while((x>0) or(i in a)):
        if(i in a):
            i+=1
            continue
        else:
            i+=1
            x-=1
    print(i-1)

C++ Code:

#include <bits/stdc++.h>    
using namespace std;
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, x, ans;
        cin >> n >> x;
        int arr[n];
        for(int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }
        bool check = true;
        for(int i = 1; x >= 0; i++)
        {
            for(int j = 0; j < n; j++)
            {
                if(i == arr[j])
                {
                    check = true;
                    break;
                }
                else 
                {
                    check = false;
                }
            }   
            if(check == false)
            {
                x--;
            }
            ans = i;
        }
        cout << ans - 1 << endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee
1647B - Madoka and the Elegant Gift
1408A - Circle Coloring
766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array