CodeForces 682B Alyona and Mex
来源:互联网 发布:音频矩阵和视频矩阵 编辑:程序博客网 时间:2024/05/22 14:47
Someone gave Alyona an array containing n positive integers a1, a2, ..., an. In one operation, Alyona can choose any element of the array and decrease it, i.e. replace with any positive integer that is smaller than the current one. Alyona can repeat this operation as many times as she wants. In particular, she may not apply any operation to the array at all.Formally, after applying some operations Alyona will get an array of n positive integers b1, b2, ..., bn such that 1 ≤ bi ≤ ai for every 1 ≤ i ≤ n. Your task is to determine the maximum possible value of mex of this array.Mex of an array in this problem is the minimum positive integer that doesn't appear in this array. For example, mex of the array containing 1, 3 and 4 is equal to 2, while mex of the array containing 2, 3 and 2 is equal to 1.
Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of elements in the Alyona's array.The second line of the input contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the array.
Output
Print one positive integer — the maximum possible value of mex of the array after Alyona applies some (possibly none) operations.
Example
Input
51 3 3 3 6Output5Input22 1Output3
Note
In the first sample case if one will decrease the second element value to 2 and the fifth element value to 4 then the mex value of resulting array 1 2 3 3 4 will be equal to 5.To reach the answer to the second sample case one must not decrease any of the array elements.
#include<algorithm>#include<iostream>using namespace std;int main(){ int n,t;cin>>n;int *a=new int [n];for(int i=0;i<n;i++)cin>>a[i];sort(a,a+n);int m=1;for(int i=0;i<n;i++)if(a[i]>=m)m++;cout<<m;}
0 0
- CodeForces 682B Alyona and Mex
- CodeForces 682B Alyona and Mex
- CodeForces 682B Alyona and Mex
- Codeforces 358 . B Alyona and Mex
- B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex
- Codeforces Round #358 (Div. 2) B. Alyona and Mex【水题】
- Codeforces Round #358 (Div. 2) B. Alyona and Mex 水题
- codeforce B. Alyona and Mex
- Codeforces Round #381C. Alyona and mex
- Codeforces 739A Alyona and mex(构造)
- 【39.66%】【codeforces 740C】Alyona and mex
- Codeforces #381 C. Alyona and mex
- CodeForces 740C - Alyona and mex(思维)
- 740C.Alyona and mex codeforces
- Codeforces Round #358 (Div. 2) B Alyona and Mex(水题)
- 简单RecyclerView入门
- chipchunp取碰撞点坐标
- BZOJ1026——windy数(数位DP)
- 自动化工具ansible基本命令和使用方式学习笔记
- linux 在线和离线安装Mplayer视频播放器
- CodeForces 682B Alyona and Mex
- 乱搞——洛谷P1311 选择客栈
- vue.js+ element 增删改查
- service层处理事务
- python与C#的互相调用
- 搭建Maven私有仓库
- CSS样式的继承详解
- No.7_7 OpenCL 同步——命令队列
- 完成FFmepg的移植,编译ffmpeg4Android