# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97891 | AKaan37 | Hindeks (COCI17_hindeks) | C++17 | 118 ms | 7544 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pair< int,int > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(lo i=1;i<=n;i++)
const int inf = 1000000000;
const int mod = 1000000007;
const int KOK = 100000;
const int li = 10000005;
const int LOG = 20;
lo n,m,cev,x,k,a[li];
vector<int> v;
char c;
string s;
int main(){
scanf("%lld",&n);
FOR{
scanf("%lld",&a[i]);
}
sort(a+1,a+n+1);
reverse(a+1,a+n+1);
FOR{
if(a[i]>=i) cev++;
}
printf("%lld\n",cev);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |