greedy implementation *1000

Please click on ads to support us..

Python Code:

kite=lambda:map(int,input().split())
_,x=kite()
print(x+sum((i==x)-(i<x)for i in kite()))

					   		 						  		  			 		

C++ Code:

#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pi 3.141592654
#define ll long long 
#define all(v)  ((v).begin()) , ((v).end())
#define cy cout<<"YES\n";
#define cn cout<<"NO\n";
#define pb push_back 
#define rbe(i,a,b) for(int i=a ; i<b ;i++) 
using namespace std;
 void can() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
}


int main(){
//وَأَنْ لَيْسَ لِلْإِنْسَانِ إِلَّا مَا سَعَى
ios::sync_with_stdio(0);
cin.tie(0);
can();
 int n,x;
 cin>>n>>x;
    int ctr=0;
    bool f=0;
 for(int i=0;i<n;i++){
    int z;cin>>z;
    if(z==x)
        f=1;
    if(z<x)
     ctr++;
 }
 
    cout<<abs(x-ctr)+f<<endl;
return 0 ;
}


Comments

Submit
0 Comments
More Questions

580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately
561. Array Partition I
1374. Generate a String With Characters That Have Odd Counts