text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
long long a[5000005];
map<long long, bool> mp;
int main() {
long long n, i, j;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
mp[a[i]] = true;
}
sort(a + 1, a + n + 1);
long long cnt = 1;
for (i = 1; i <= n; i++) {
if (a[i] >= cnt) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, val;
cin >> n;
vector<int> arr;
for (int i = 0; i < n; i++) {
scanf("%d", &val);
arr.push_back(val);
}
sort(arr.begin(), arr.end());
int curr = 1;
for (int i = 0; i < n; i++) {
if (arr[i] < curr) {
curr--;
}
curr++;
}
cout << curr << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int mx = 1e5 + 10;
using namespace std;
long long a[mx], b[mx];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, ans = 1, tmp = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (a[i] >= ans) {
a[i] = ans;
ans++;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
vector<long int> a(N);
for (long int n = 0; n < N; n++) {
cin >> a[n];
}
long int least_integer = 1;
std::sort(a.begin(), a.end());
for (long int n = 0; n < N; n++) {
if (a[n] >= least_integer) least_integer++;
}
cout << least_integer;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<long long> a;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
if (a[0] != 1) a[0] = 1;
for (int i = 1; i < n; i++)
if (a[i] - a[i - 1] > 1) a[i] = a[i - 1] + 1;
cout << a[n - 1] + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, a, b, ts, f = 1, cn = 0, n, in, ar[100009];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &ar[i]);
}
sort(ar, ar + n);
in = 1;
for (i = 0; i < n; i++) {
if (ar[i] >= in) {
in++;
}
}
printf("%d\n", in);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int arr[n];
int i;
for (i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
int mex = 1;
for (i = 0; i < n; i++) {
if (arr[i] >= mex) mex++;
}
cout << mex;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int curr = 1;
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
if (arr[i] >= curr) curr++;
}
cout << curr << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int N = 1E5 + 4;
int arr[N];
int main() {
fast();
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int mex = 1;
sort(arr, arr + n);
for (int i = 0; i < n; ++i) {
if (arr[i] >= mex) mex++;
}
cout << mex << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100002];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
int k = 1;
for (int i = 0; i < n; i++)
if (a[i] >= k) k++;
printf("%d\n", k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[100001], temp = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
if (arr[i] > i || arr[i] != temp) {
arr[i] = ++temp;
} else if (arr[i] == i)
temp = i;
else
arr[i] = temp;
}
cout << arr[n - 1] + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ans[100009];
int cmp(int a, int b) { return a <= b; }
int main() {
int n;
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++) scanf("%d", &ans[i]);
sort(ans, ans + n);
int vaule = 0;
for (int i = 0; i < n; i++) {
if (ans[i] > vaule) vaule++;
}
printf("%d\n", vaule + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, n;
map<long long int, long long int> mp;
cin >> n;
long long int a[100010];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long int last = 1;
for (i = 0; i < n; i++) {
if (a[i] > last) {
a[i] = last;
last = a[i] + 1;
} else if (a[i] == last)
last = a[i] + 1;
}
for (i = 0; i < n; i++) {
mp[a[i]]++;
}
for (i = 1; i <= 100000; i++) {
if (mp[i] == 0) {
cout << i << endl;
return 0;
}
}
cout << i << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, ans = 1, a[100001];
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (a[i] >= ans) ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, temp = 1;
cin >> n;
long long int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] == temp)
temp++;
else if (a[i] < temp)
continue;
else {
a[i] = temp;
temp++;
}
}
cout << temp;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, i, x = 0;
scanf("%ld", &n);
vector<long int> v;
for (i = 0; i < n; i++) {
scanf("%ld", &x);
v.push_back(x);
}
sort(v.begin(), v.end());
vector<long int>::iterator it;
for (i = 1; i <= v[n - 1]; i++) {
if (binary_search(v.begin(), v.end(), i)) continue;
it = upper_bound(v.begin(), v.end(), i);
if (*it == v[n - 1]) {
if (i < *it)
v[it - v.begin()] = i;
else
break;
}
v[it - v.begin()] = i;
}
printf("%ld", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> vec;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
vec.push_back(x);
}
sort(vec.begin(), vec.end());
if (vec[0] > 1) {
vec[0] = 1;
}
for (int i = 1; i < n; i++) {
if (vec[i] - vec[i - 1] > 1) {
vec[i] = vec[i - 1] + 1;
}
}
cout << vec.back() + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long long i;
long long a[n];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
a[0] = 1;
for (i = 1; i < n; i++) {
if (a[i] - a[i - 1] > 1) a[i] = a[i - 1] + 1;
}
cout << a[n - 1] + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int v[100111];
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) cin >> v[i];
sort(v, v + n);
int ans = 1;
for (int i = 0; i < n; i++) {
if (v[i] >= ans) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, c = 1, a[1000007];
int main(int argc, char** argv) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] >= c) c++;
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int d[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &d[i]);
sort(d + 1, d + 1 + n);
int ans = 0;
for (int i = 1; i <= n; i++)
if (ans < d[i]) ans++;
printf("%d\n", ans + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int choose(long long int n, long long int m) {
long long int ans = 0;
long long int num = 1;
long long int den = 1;
for (long long int i = 0; i < m; i++) {
num *= (n - i);
num = num / (i + 1);
}
return num;
}
bool isPrime(int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6) {
if (n % i == 0 || n % (i + 2) == 0) return false;
}
return true;
}
long long int gcd(long long int a, long long int b) {
if (a == 0) {
return b;
} else {
return gcd(b % a, a);
}
}
long long int sumOfDigits(long long int n) {
long long int c = 0;
while (n != 0) {
c += n % 10;
n = n / 10;
}
return c;
}
long long int lengthOfNumber(long long int n) {
long long int l = 0;
while (n != 0) {
l++;
n /= 10;
}
return l;
}
long long int makeNum(long long int l) {
long long int c = 0, n = 0;
while (c != l) {
n = n * 10;
n += 9;
c++;
}
return n;
}
long long modRecursion(long long a, long long b, long long c) {
if (b == 0) return 1;
if (b == 1)
return a % c;
else if (b % 2 == 0) {
return modRecursion((a * a) % c, b / 2, c);
} else {
return (a * modRecursion((a * a % c), b / 2, c)) % c;
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
long long int i, j, k, n, t;
cin >> n;
vector<long long int> a(n);
map<long long int, long long int> m;
for (i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
sort(a.begin(), a.end());
k = 1;
for (i = 0; i < n; i++) {
if (a[i] > k) {
m[a[i]]--;
a[i] = k;
k++;
} else if (a[i] == k) {
k++;
}
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[100010];
int main() {
long long n, i;
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + 1 + n);
long long lol = 1;
for (i = 1; i <= n; i++) {
if (a[i] >= lol) a[i] = lol, lol++;
}
cout << lol;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> m;
int main() {
long long int n, i, j = 1;
scanf("%lld", &n);
long long int arr[n];
for (i = 0; i < n; i++) scanf("%lld", &arr[i]);
sort(arr, arr + n);
for (i = 0; i < n; i++) {
if (arr[i] >= j)
j++;
else
continue;
}
printf("%lld\n", j);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i = 0, input = 0, size = 0;
cin >> size;
vector<int> vals;
for (i = 0; i < size; i++) {
cin >> input;
if (input >= 1) vals.push_back(input);
}
sort(vals.begin(), vals.end());
i = 1;
for (unsigned int ind = 0; ind < vals.size();) {
if (vals[ind] >= i) {
ind++;
i++;
} else if (vals[ind] < i)
ind++;
}
cout << i << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int j = 1;
for (i = 0; i < n; i++) {
if (arr[i] >= j) j++;
}
cout << j << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 1;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int ta;
cin >> ta;
a.push_back(ta);
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] >= ans) {
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0;
cin >> n;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = 1;
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (a[i] >= max) {
a[i] = max;
max++;
}
}
cout << a[n - 1] + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int ara[100005];
int main() {
int n, m, i, j, p, q, men;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &ara[i]);
sort(ara, ara + n);
men = 1;
for (i = 1; i < n; i++) {
if (ara[i] > men) men++;
}
printf("%d\n", men + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
int main() {
fast();
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int mex = 1;
for (int i = 0; i < n; i++) {
if (arr[i] >= mex) mex++;
}
cout << mex << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double eps = 0.0001;
struct drago {
int a;
bool operator<(const drago a) const { return this->a < a.a; }
};
int main() {
int n;
cin >> n;
drago* mas = new drago[n];
for (int i = 0; i < n; i++) cin >> mas[i].a;
sort(mas, mas + n);
int res = 1;
for (int i = 0; i < n; i++)
if (mas[i].a >= res) res++;
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int current = 0;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
sort(arr, arr + n);
for (int i = 0; i < n; ++i) {
if (current < arr[i]) ++current;
}
cout << current + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, i, j, k = 5, c = 1;
cin >> n;
int A[n];
for (i = 0; i < n; i++) {
cin >> A[i];
}
sort(A, A + n);
for (i = 0; i < n; i++) {
if (A[i] >= c) {
c++;
}
}
printf("%d\n", c);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int i, a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long long int x = 1;
for (i = 0; i < n; i++) {
if (a[i] >= x) {
a[i] = x;
x++;
} else {
continue;
}
}
cout << x << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
bool prime[1000001];
void sieve() {
memset(prime, true, sizeof(prime));
for (int i = 2; i * i <= 1000000; i++)
if (prime[i])
for (int j = i * i; j <= 1000000; j += i) prime[j] = false;
prime[0] = prime[1] = false;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long int pow(long long int a, long long int b, long long int MOD) {
long long int x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD) x %= MOD;
}
y = (y * y);
if (y > MOD) y %= MOD;
b /= 2;
}
return x;
}
int main() {
long long int n;
cin >> n;
int arr[n];
for (int j = 0; j < n; j++) {
cin >> arr[j];
}
sort(arr, arr + n);
int p1 = 1;
int ans = 1;
for (int k = 0; k < n; k++) {
if (arr[k] >= p1) {
p1++;
} else {
}
}
ans = p1;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100010];
long long g = 1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (a[i] >= g) {
g++;
}
}
cout << g << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<T> &v) {
for (typename vector<T>::size_type i = 0; i < v.size(); ++i)
out << v[i] << " ";
out << "\n";
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, vector<vector<T> > &v) {
for (size_t i = 0; i < v.size(); ++i) {
for (size_t j = 0; j < v[i].size(); ++j) {
out << v[i][j] << " ";
}
out << "\n";
}
return out;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i) cin >> arr[i];
sort(arr.begin(), arr.end());
int x = 1;
for (int i = 0; i < n; ++i) {
if (x < arr[i]) {
arr[i] = x;
++x;
} else {
x = arr[i] + 1;
}
}
cout << arr[n - 1] + 1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cur = 1;
cin >> n;
int arr[100000];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
if (arr[i] >= cur) cur++;
}
cout << cur << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int mo[10];
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
for (int i = int(0); i <= int(n - 1); i++) {
scanf("%d", a + i);
}
sort(a, a + n);
a[0] = 1;
for (int i = int(1); i <= int(n - 1); i++) {
if (a[i] > a[i - 1])
a[i] = a[i - 1] + 1;
else
a[i] = a[i - 1];
}
printf("%d\n", a[n - 1] + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long int ABS(long long int a) {
if (a < 0) return (-a);
return a;
}
inline long long int min(long long int a, long long int b, long long int c) {
return min(a, min(b, c));
}
inline long long int max(long long int a, long long int b, long long int c) {
return max(a, max(b, c));
}
inline long long int powmod(long long int x, long long int n,
long long int _mod) {
long long int res = 1;
while (n) {
if (n & 1) res = (res * x) % _mod;
x = (x * x) % _mod;
n >>= 1;
}
return res;
}
inline long long int gcd(long long int a, long long int b) {
long long int t;
while (b) {
a = a % b;
t = a;
a = b;
b = t;
}
return a;
}
inline long long int lcm(long long int a, long long int b) {
return a / (gcd(a, b) * b);
}
inline int bitCount(unsigned int i) { return __builtin_popcount(i); }
inline void cinarr(long long int x[], long long int n) {
for (long long int i = 0; i < (n); ++i) cin >> (x[i]);
}
inline void cinvec(vector<long long int> &arr, long long int n) {
for (long long int i = 0; i < (n); ++i) {
long long int x;
cin >> (x);
arr.push_back(x);
};
}
const int v5 = 100000;
const int v9 = 1000000000;
const int v6 = 1000000;
long long int n, m, k, c = 0;
vector<long long int> a;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> (n);
for (int i = (1); i < (n + 1); ++i) {
long long int x;
cin >> (x);
a.push_back(x);
}
sort(a.begin(), a.end());
long long int cx = 1;
for (int i = (0); i < (n); ++i) {
if (cx <= a[i]) cx += 1;
}
cout << cx << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n, a, max, dif;
vector<long long int> v;
cin >> n;
for (long long int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
if (v.at(0) > 1) {
v.at(0) = 1;
max = 1;
}
for (long long int i = 1; i < n; i++) {
dif = v.at(i) - v.at(i - 1) - 1;
if (dif >= 1) v.at(i) = v.at(i - 1) + 1;
max = v.at(i);
}
cout << max + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (long long int i = 0; i < n; ++i) {
cin >> a[i];
}
long long j = 1;
sort(a, a + n);
for (long long i = 0; i < n; ++i) {
if (a[i] >= j) {
a[i] = j;
++j;
}
}
cout << j << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n, x, l = 1;
;
cin >> n;
vector<long long> vec;
for (int i = 0; i < n && cin >> x; i++) {
vec.push_back(x);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < n; i++) {
if (vec[i] != l && i != 0) l++;
if (vec[i] > l) {
vec[i] = l;
}
}
cout << vec.back() + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
int ans, cur = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
if (a[i] >= cur)
cur++;
else
continue;
}
printf("%d\n", cur);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct cmp {
bool operator()(long long int a, long long int b) { return (a > b); }
};
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int t = 1;
for (int i = 0; i < n; i++) {
if (arr[i] >= t) {
t++;
}
}
cout << t << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int MAXA = 1e9 + 9;
int N;
int A[MAXN];
void solve() {
sort(A, A + N);
int mex = 1;
for (int i = 0; i < N; ++i) {
if (A[i] >= mex) ++mex;
}
cout << mex << endl;
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) scanf("%d", A + i);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[112345];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &v[i]);
sort(v, v + n);
int res = 1;
for (int i = 0; i < n; i++) {
if (v[i] >= res) {
v[i] = res;
res++;
}
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
int cmpfn(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
int main() {
long int n;
scanf("%ld", &n);
long int a[n];
for (int i = 0; i < n; i++) {
scanf("%ld", &a[i]);
}
long int curr = 1;
qsort(a, n, sizeof(long int), cmpfn);
for (int j = 0; j < n; j++) {
if (a[j] >= curr) curr = curr + 1;
}
printf("%ld\n", curr);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<ld, ld>;
const int MIN = 2e5 + 20;
const int MAX = 1e9 + 20;
str s, t;
int a[MIN], l = 1, n, c, c0, b, d, k, i, j;
int main() {
cin >> n;
for (i = (0); i <= (n - 1); i++) cin >> a[i];
sort(a, a + n);
for (i = (0); i <= (n - 1); i++)
if (a[i] >= l) l++;
cout << l;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
bool chk[N];
void solve() {
long long n;
cin >> n;
vector<long long> v(n);
for (auto &i : v) {
cin >> i;
}
sort((v).begin(), (v).end());
long long mini = 1;
for (auto &i : v) {
if (mini <= i) {
i = mini;
mini++;
}
}
cout << mini;
}
int32_t main() {
long long t = 1;
while (t--) {
solve();
}
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ans;
int a[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
ans = 1;
for (int i = 1; i <= n; i++)
if (a[i] >= ans) ans++;
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
long int a[100005];
int main() {
long int n, m, rem1, rem2, div1, div2, res;
long int total;
while (cin >> n) {
for (int i = 0; i < n; i++) {
scanf("%ld", &a[i]);
}
sort(a, a + n);
res = 1;
for (int i = 0; i < n; i++) {
if (a[i] >= res) {
res++;
}
}
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int i, n, ans = 0;
long long a[maxn];
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] > ans) ans++;
}
cout << ans + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
multiset<int> m;
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
m.insert(a);
}
for (int i = 1; i <= n + 10; i++) {
multiset<int>::iterator it;
it = m.lower_bound(i);
if (it == m.end()) {
cout << i << endl;
return 0;
} else {
m.erase(it);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, mix, ans, d[100000];
vector<long long> v, v1;
string s[1000000];
map<char, int> mp;
int main() {
cin >> a;
ans = 1;
for (int i = 0; i < a; i++) {
cin >> d[i];
}
sort(d, d + a);
for (int i = 0; i < a; i++) {
if (d[i] >= ans) {
ans++;
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long arr[100005];
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
long long temp = 1;
for (int i = 0; i < n; i++) {
if (arr[i] > temp)
arr[i] = temp++;
else
temp = arr[i] + 1;
}
cout << arr[n - 1] + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; cin >> arr[i++])
;
sort(arr, arr + n);
arr[0] = 1;
for (int i = 1; i < n; ++i) {
if (arr[i] != arr[i - 1] && arr[i] != arr[i - 1] + 1) {
arr[i] = arr[i - 1] + 1;
}
}
cout << arr[n - 1] + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
void solve(std::istream& in, std::ostream& out) {
int n;
in >> n;
vector<int> vi(n, 0);
for (int i = 0; i < (int)(n); ++i) {
in >> vi[i];
}
sort((vi).begin(), (vi).end());
int x = 1;
for (int index = 0; index < (int)(n); ++index) {
if (vi[index] >= x) {
++x;
}
}
out << x << endl;
}
};
void solve(std::istream& in, std::ostream& out) {
out << std::setprecision(12);
Solution solution;
solution.solve(in, out);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
istream& in = cin;
ostream& out = cout;
solve(in, out);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n + 1];
long long exp = 1;
long long x;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
x = a[i];
if (x >= exp) {
exp++;
} else
continue;
}
cout << exp << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int tot = 1;
for (int i = 0; i < n; i++) {
if (a[i] < tot) continue;
tot++;
}
printf("%d\n", tot);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long maxm = -1e18;
long long minm = 1e18;
bool isP(long long n) {
if (n == 2LL) return 1;
if (n % 2LL == 0LL)
return 0;
else if (n == 1)
return 0;
for (long long i = 3; i * i <= n; ++i)
if (n % i == 0) return 0;
return 1;
}
void solve() {
long long n;
cin >> n;
vector<long long> a(n + 1, 0);
for (int i = 1; i <= n; i++) cin >> a[i];
sort((a).begin(), (a).end());
long long ans = 1;
long long x = 1;
for (int i = 1; i <= n; i++) {
if (a[i] >= x) {
ans++;
x++;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
map<int, int> a;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &m);
a[m]++;
}
int ans = 0;
for (auto i : a) ans = min(ans + i.second, i.first);
cout << ans + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n;
int a[maxn];
int main() {
while (~scanf("%d", &n)) {
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int ans = 1;
for (int i = 0; i < n; i++) {
if (a[i] >= ans) ans++;
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void scan(int &n) {
int sign = 1;
n = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = getchar();
}
while (c >= '0' && c <= '9') n = (n * 10) + c - '0', c = getchar();
n = n * sign;
}
void lscan(long long &n) {
int sign = 1;
n = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') sign = -1;
c = getchar();
}
while (c >= '0' && c <= '9') n = (n * 10) + c - '0', c = getchar();
n = n * (long long)(sign);
}
int sscan(char a[]) {
char c = getchar();
while (c == ' ' || c == '\n') c = getchar();
int i = 0;
while (c != '\n') a[i++] = c, c = getchar();
a[i] = 0;
return i;
}
int wscan(char a[]) {
char c = getchar();
while (c == ' ' || c == '\n') c = getchar();
int i = 0;
while (c != '\n' && c != ' ') a[i++] = c, c = getchar();
a[i] = 0;
return i;
}
void print(int n) {
if (n < 0) {
n = -n;
putchar('-');
}
int i = 10;
char o[10];
do {
o[--i] = (n % 10) + '0';
n /= 10;
} while (n);
do {
putchar(o[i]);
} while (++i < 10);
}
void lprint(long long n) {
if (n < 0LL) {
n = -n;
putchar('-');
}
int i = 21;
char o[21];
do {
o[--i] = (n % 10LL) + '0';
n /= 10LL;
} while (n);
do {
putchar(o[i]);
} while (++i < 21);
}
void sprint(const char a[]) {
const char *p = a;
while (*p) putchar(*p++);
}
int main() {
int n;
scan(n);
long long arr[n];
for (int i = 0; i < n; i++) {
lscan(arr[i]);
}
sort(arr, arr + n);
long long index = 1;
arr[0] = 1;
for (int i = 1; i < n; i++) {
if (arr[i] > arr[i - 1]) {
index++;
arr[i] = index;
}
}
index++;
lprint(index);
putchar('\n');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
long int arr[n];
for (long int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
if (arr[0] != 1) arr[0] = 1;
for (int i = 0; i < n - 1; i++) {
if (arr[i + 1] - arr[i] > 0) {
long int diff = arr[i + 1] - arr[i];
arr[i + 1] -= diff - 1;
}
}
cout << (arr[n - 1] + 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + n);
int curr = 1;
for (int i = 0; i < n; i++) {
if (arr[i] < curr) {
curr = arr[i] + 1;
} else {
curr++;
}
}
printf("%d\n", curr);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int s[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &s[i]);
sort(s, s + n);
int m;
s[0] = 1;
for (int i = 0; i < n; i++) {
if (s[i + 1] - s[i] > 1) {
s[i + 1] = s[i] + 1;
}
m = s[i] + 1;
}
printf("%d", m);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, t;
vector<int> a;
for (i = 0; i < n; i++) {
cin >> t;
a.push_back(t);
}
sort(a.begin(), a.end());
for (i = 0; i < n; i++) {
if (i == 0) {
if (a[i] != 1) a[i] = 1;
continue;
}
if (a[i] > a[i - 1]) a[i] = a[i - 1] + 1;
}
cout << a[n - 1] + 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 1;
const int N = 1000002;
long long gcd(long long x, long long y) {
if (y == 0) return x;
return gcd(y, x % y);
}
long long power(long long A, long long B, long long mod = 1000000007) {
long long r = 1;
while (B > 0) {
if (B & 1LL) r = (r * A) % mod;
A = (A * A) % mod;
B >>= 1;
}
return r;
}
struct set_comp {
bool operator()(const int& lhs, const int& rhs) { return lhs < rhs; }
};
int a[100002];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n, i;
cin >> n;
int c = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
for (i = 1; i <= n; i++) {
if (c == a[i]) {
} else if (c < a[i]) {
c++;
}
}
cout << c + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long int N, ans = 0, arr[100099];
cin >> N;
for (int A = 1; A <= N; A++) cin >> arr[A];
sort(arr, arr + N + 1);
for (int B = 1; B <= N; B++) {
if (arr[B] > ans) ans++;
}
cout << ans + 1;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, a[100001], d = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
std::sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] > d) d++;
printf("%d\n", d + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int ans = 1, m, n, q1, q2, r1, r2, a[100010], m1[10], i;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < n; i++) {
if (a[i] >= ans) {
ans++;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void omajinai() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(15);
}
priority_queue<long long, vector<long long>, greater<long long>> pq;
int main() {
omajinai();
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
pq.push(x);
}
int ans = 0;
while (!pq.empty()) {
long long t = pq.top();
if (t >= ans + 1) {
ans++;
}
pq.pop();
}
cout << ans + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool cmp(int a, int b) {
if (a < b)
return true;
else
return false;
}
int main(void) {
int n, arr[100000 + 20];
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
sort(arr + 1, arr + n + 1, cmp);
int temp = 0;
for (int i = 1; i <= n; i++) {
if (temp == arr[i]) continue;
if (arr[i] > temp) {
temp++;
arr[i] = temp;
}
}
printf("%d\n", temp + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
int mn = a[1];
if (a[1] > 1) {
a[1] = 1;
mn = 1;
}
for (int i = 2; i <= n; i++) {
if (a[i] > mn) {
mn++;
a[i] = mn;
}
}
cout << a[n] + 1 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
int n, m;
int ary[100000 + 10];
int main() {
int i, j;
cin >> n;
for (i = 0; i < n; i++) scanf("%d", &ary[i]);
sort(ary, ary + n);
int ans = 0;
for (i = 0; i < n; i++) {
if (ary[i] > ans) ans++;
}
cout << ans + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int a[100010];
int main() {
int n;
cin >> n;
int sum = 1;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int max = -1;
for (int i = 1; i <= n; i++) {
if (a[i] > a[i - 1]) {
a[i] = a[i - 1] + 1;
}
}
cout << a[n] + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, i, j, k, x;
cin >> n;
priority_queue<int> pq;
for (i = 0; i < n; i++) {
cin >> x;
pq.push(-x);
}
for (i = 1;; i++) {
while (!pq.empty() && (-pq.top() < i)) pq.pop();
if (pq.empty()) break;
pq.pop();
}
cout << i << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = int(1e9);
const long long INFll = 1ll * INF * INF;
const long double ldINF = 1e+018;
const long double EPS = 0.000000001;
const int base = INF;
const int sdx[4] = {0, 1, 0, -1};
const int sdy[4] = {1, 0, -1, 0};
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int ans = 1;
for (int i = 0; i < n; i++) {
if (a[i] < ans) continue;
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
auto comp = std::greater<int>();
int numbers[100000];
int n = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &numbers[i]);
std::push_heap(numbers, numbers + i + 1, comp);
}
int ans = 1;
while (n > 0) {
std::pop_heap(numbers, numbers + (n--), comp);
int val = numbers[n];
if (val >= ans) ans++;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> vec(n);
for (int i = 0; i < n; i++) cin >> vec[i];
sort(vec.begin(), vec.end());
long long cur_no = 1;
for (int i = 0; i < n; i++) {
if (vec[i] >= cur_no) cur_no++;
}
cout << cur_no;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> tab;
tab.resize(n);
for (int i = 0; i < n; ++i) cin >> tab[i];
sort(tab.begin(), tab.end());
int mex = 1;
for (int i = 0; i < n; ++i) {
if (tab[i] >= mex) mex++;
}
cout << mex << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
int curr = 1;
for (int i = 0; i < n; i++) {
if (arr[i] >= curr) {
curr++;
}
}
cout << curr;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
int ans = 0;
for (int i = 0; i < n; i++) {
ans = min(ans + 1, arr[i]);
}
cout << ++ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ara[100000];
cin >> n;
for (int i = 0; i < n; i++) cin >> ara[i];
sort(ara, ara + n);
int cnt = 1;
for (int i = 0; i < n; i++) {
if (ara[i] >= cnt) {
ara[i] = cnt;
cnt++;
}
}
cout << ara[n - 1] + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int f(vector<long long int> vec, long long int n) {
long long int i;
if (vec[0] > 1) return 1;
for (i = 0; i < n - 1; i++) {
if (vec[i + 1] > (vec[i] + 1)) return (vec[i] + 1);
}
return (vec[n - 1] + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i;
cin >> n;
vector<long long int> vec(n);
for (i = 0; i < n; i++) cin >> vec[i];
if (n == 1) {
cout << 2;
return 0;
}
sort(vec.begin(), vec.end());
long long int ff = f(vec, n);
if (vec[0] > 1) vec[0] = 1;
for (i = 1; i < n; i++) {
if (vec[i] < ff)
continue;
else {
if ((vec[i - 1] + 1) < vec[i])
vec[i] = vec[i - 1] + 1;
else
continue;
}
}
cout << f(vec, n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
long long n;
cin >> n;
vector<long long> v;
for (long long i = 0; i < n; i++) {
long long temp;
cin >> temp;
v.push_back(temp);
}
sort(v.begin(), v.end());
long long going = 1;
for (long long i = 0; i < n; i++) {
if (v[i] >= going) {
going++;
continue;
}
}
cout << going;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, a[maxn], cur = 1;
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++)
if (a[i] >= cur) cur++;
cout << cur << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
long long int n;
cin >> n;
long long int a[n], i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
a[0] = 1;
for (i = 0; i < n - 1; i++) {
if (a[i + 1] > a[i]) {
a[i + 1] = a[i] + 1;
}
}
long long int flag = 0;
for (i = 0; i < n - 1; i++) {
if (a[i + 1] - a[i] > 1) {
flag = 1;
break;
}
}
if (flag == 0) {
cout << a[n - 1] + 1;
} else
cout << a[i] + 1;
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
int mx = 0;
for (int i = 0; i < n; ++i) {
if (a[i] > mx) {
++mx;
}
}
cout << mx + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, l;
cin >> n;
long long int a[n + 1];
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
long long int x = 1;
for (i = 0; i < n; i++) {
if (a[i] >= x) {
x += 1;
}
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) scanf("%d", &A[i]);
sort(A.begin(), A.end());
int nxt_val = 1;
for (int i = 0; i < N; i++)
if (A[i] >= nxt_val) nxt_val++;
cout << nxt_val << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
clock_t time_p = clock();
void shahil_005() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
int power(long long x, long long y) {
if (y == 0) return 1;
long long p = power(x, y / 2);
p = (p * p);
return (y % 2 == 0) ? p : (x * p);
}
int powm(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
if (x == 0) {
return 0;
}
while (y > 0) {
if (y & 1) {
res = (res * x) % p;
}
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int lcm(long long a, long long b) {
long long lar = max(a, b);
long long small = min(a, b);
for (long long i = lar;; i += lar) {
if (i % small == 0) return i;
}
}
int gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int bsearch(long long arr[], long long l, long long r, long long x) {
while (l <= r) {
long long m = l + (r - l) / 2;
if (arr[m] == x) {
return m;
}
if (arr[m] < x) {
l = m + 1;
} else
r = m - 1;
}
return -1;
}
bool prime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
}
bool sortbydec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return a.first > b.first;
}
const int N = 1e5 + 5;
const long long MOD = (long long)(1e9 + 7);
const long long INIT = (long long)(1e6 + 1);
void solve() {
long long n;
cin >> n;
long long a[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
long long x = 1;
map<long long, long long> m;
for (long long i = 1; i <= n; i++) {
if (a[i] >= x) {
m[x]++;
x++;
}
}
long long flag = 1;
for (auto &it : m) {
if (it.second == 0) {
cout << it.first;
flag = 0;
break;
}
}
if (flag) {
cout << x;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int cur = 1, n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
if (a[i] >= cur) cur = cur + 1;
}
cout << cur;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i = 0;
vector<int> x(n);
int z = 1;
while (i < n) {
cin >> x[i];
i++;
}
sort(x.begin(), x.end());
i = 0;
while (i < n) {
if (x[i] >= z) z++;
i++;
}
cout << z;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
int ans = 1;
for (int i = 2; i <= n; i++) {
if (a[i] > ans) ans++;
}
cout << ans + 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
register long long int n, i, j, a = 1, b, c;
cin >> n;
register long long int x[n];
for (i = 0; i < n; i++) {
cin >> x[i];
}
sort(x, x + n);
for (i = 0; i < n; i++) {
if (x[i] >= a) {
x[i] = a;
a++;
}
}
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int X = 1;
sort(A, A + N);
int F = 1;
for (int i = 0; i < N; i++) {
if (X < A[i]) {
A[i] = X;
X++;
}
if (A[i] == X) {
X++;
}
}
cout << X << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
int current = 1;
for (int i = 0; i < n; i++) {
if (a[i] < current) continue;
a[i] = current;
current++;
}
cout << a.back() + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int ans = 1;
int cur = 1;
for (int i = 0; i < n; i++)
if (a[i] >= cur) {
ans++;
cur++;
}
printf("%d\n", ans);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.