Submission #86315

#TimeUsernameProblemLanguageResultExecution timeMemory
86315dimash241Hindeks (COCI17_hindeks)C++17
5 / 50
322 ms32276 KiB
# 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); cout << n - cnt[a[1]]; return Accepted; } // Coded By OB
#Verdict Execution timeMemoryGrader output
Fetching results...