# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
86345 |
2018-11-26T07:44:12 Z |
Pluton |
Hindeks (COCI17_hindeks) |
C++14 |
|
110 ms |
2672 KB |
#include <bits/stdc++.h>
#define ld long double
#define ll long long
#define sz size()
#define all(xx) xx.begin(),xx.end()
#define pb push_back
#define in insert
#define er erase
#define S second
#define F first
#define pii pair <int, int>
#define to_be continue
#define mp make_pair
#define stop exit (0)
#define fname ""
#define speed ios_base::sync_with_stdio(0);cin.tie(0)
#define input freopen (fname".in", "r", stdin)
#define output freopen (fname".out", "w", stdout)
//#define int ll
#define N 600000
using namespace std;
const int inf = 1e9 + 123;
const ll INF = 1e18 + 123;
const double pi = acos (-1.0);
const ld eps = 1e-3;
int n, a[N], ans;
int main ()
{
speed;
cin >> n;
for (int i = 1; i <= n; i ++)
cin >> a[i];
sort (a + 1, a + 1 + n);
for (int i = 1; i <= n; i ++)
{
if (a[i] != a[i + 1])
{
if (a[i] < n - i && a[i + 1] >= n - i)
ans = n - i;
}
}
cout << ans;
}
//Coded by A....
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
5 |
Correct |
2 ms |
552 KB |
Output is correct |
6 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
7 |
Correct |
4 ms |
552 KB |
Output is correct |
8 |
Correct |
22 ms |
1064 KB |
Output is correct |
9 |
Incorrect |
110 ms |
2672 KB |
Output isn't correct |
10 |
Incorrect |
52 ms |
2672 KB |
Output isn't correct |