#include <bits/stdc++.h>
using namespace std;
signed main()
{
int n, q, l, r;
cin >> n >> q;
vector<int> p(n, 0);
for (int i = 0; i < n; ++i)
{
cin >> p[i];
}
for (int i = 0; i < q; ++i)
{
cin >> l >> r;
unordered_map<int, int> m;
int nummax = 0;
for (int i = l - 1; i < r; ++i)
{
m[p[i]]++;
nummax = max(nummax,p[i]);
}
int t = 0;
int maxh = 0;
for (auto i = nummax; i >= 0; --i)
{
if (i <= m[i] + t)
{
maxh = i;
break;
}
t += m[i];
}
cout << maxh << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |