#include <bits/stdc++.h>
#define GLHF ios_base::sync_with_stdio(0); cin.tie(), cout.tie();
#define GGWP return 0;
#define ALTF4 exit(0)
#define GCWS/*Good Contest, Well Solved*/ ALTF4
#define ull unsigned long long
#define ll long long
#define ld long double
#define fxr1(x) for(int I = 0; I < x; ++I)
#define fxr(x) for(int I = 0; I <= x; ++I)
#define F first
#define S second
using namespace std;
int n, a[500001], b[500001];
int main()
{
GLHF
cin >> n;
for ( int I = 0; I < n; ++I )
cin >> a[I];
sort(a, a + n);
for ( int I = 0; I < n - 1; ++I )
{
if ( a[0] < a[I] )
++b[0];
}
cout << b[0] << endl;
GGWP
}
//clang++ -v -std=c++11 finish fishing the fish.people
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
512 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
560 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
560 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
644 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
644 KB |
Output isn't correct |