Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<vector>
- #include<algorithm>
- using namespace std;
- int solution(vector<int>&A){
- if(A.size()==1)
- {
- if(A[0]<=0)
- return 1;
- else if(A[0]!=1)
- return 1;
- else return 2;
- }
- sort(A.begin(),A.end());
- int temp=-1;
- for(int i=0;i<A.size();i++)
- {
- //cout<<A[i];
- if(A[i]>0)
- {
- temp=i;
- break;
- }
- }
- if(temp==-1)
- return 1;
- bool flag=false;
- for(int i=temp;i<A.size()-1;i++)
- {
- int sum=A[i+1]-A[i];
- // cout <<sum;
- if((sum)>1 )
- {
- flag=false;
- return A[i]+1;
- }
- if(!flag)
- return A[A.size()-1]+1;
- }
- }
- int main()
- {
- vector<int> v;
- int n;
- cin>>n;
- for(int i=0;i<n;i++)
- {
- int y;
- cin>>y;
- v.push_back(y);
- }
- cout<<solution(v);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement