oj.uz

Submission #86420

# Submission time Handle Problem Language Result Execution time Memory
86420 2018-11-26T09:43:35 Z dimash241 Hindeks (COCI17_hindeks) C++17
30 / 50
 304 ms 28256 KB 
# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 1e6 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int cnt[N];
string s;
int a[N];
vector < int > g[N];
int u[N];
int ans, res;
int cur;

int main () {               
    cin >> n;
    For (i, 1, n) {
    	cin >> a[i];
    	cnt[a[i]] ++;
    }
    sort(a + 1, a + n + 1);

    For (i, 0, 1e6) {
    	if (i == n - cur) {
    		cout << i;
    		exit(0);
    	}
    	cur += cnt[i];
    }
    For (i, 0, 1e6) {
    	if (i <= n - cur) {
    		cout << i;
    		exit(0);
    	}
    	cur += cnt[i];
    }
    cout << 0;
    return Accepted;
}

// Coded By OB

Subtask #1
30.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23800 KB Output is correct
2 Correct 24 ms 23932 KB Output is correct
3 Incorrect 26 ms 23932 KB Output isn't correct
4 Incorrect 26 ms 23968 KB Output isn't correct
5 Correct 24 ms 23968 KB Output is correct
6 Incorrect 27 ms 23968 KB Output isn't correct
7 Correct 28 ms 24060 KB Output is correct
8 Correct 74 ms 24824 KB Output is correct
9 Incorrect 304 ms 28256 KB Output isn't correct
10 Correct 142 ms 28256 KB Output is correct