제출 #856061

#제출 시각아이디문제언어결과실행 시간메모리
856061vjudge1Hindeks (COCI17_hindeks)C++17
50 / 50
70 ms4184 KiB
#pragma GCC optimize("unroll-loops,Ofast,O3") #include <bits/stdc++.h> #define pb push_back #define mp make_pair #define spc << " " << #define endl "\n" #define all(x) x.begin(), x.end() #define int long long #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define st first #define nd second #define inf 1000000009 #define MOD 1000000007 #define lim 200005 using namespace std; void solve(){ int n; cin >> n; int arr[n+1]; int ans=0; for(int i=1; i<=n; i++) cin >> arr[i]; sort(arr+1, arr+n+1); for(int i=1; i<=n; i++){ ans = max(ans, min(n-i+1, arr[i])); } cout << ans << endl; } signed main(){ ios_base::sync_with_stdio(false);cin.tie(0); #ifdef Local freopen("in","r",stdin); freopen("out","w",stdout); #endif int t=1; //cin >> t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...