FilesExpand file tree

 master

/

B.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

55 lines (47 loc) · 981 Bytes

 master

/

B.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

55 lines (47 loc) · 981 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

#include <iostream>

#include <cstdio>

#include <algorithm>

using namespace std;

const int MAXN = 100001;

const int INF = 900000000;

int N;

int d[MAXN];

void work(){

/*

for(int i=0; i<N; i++){

cout<<data[i]<<" ";

}cout<<endl;

*/

int ans = -INF;

for(int i=0; i<N-1; i++){

int low = i+1;

int high = N-1;

int tmp_ans = -1;

int mid;

//cout<<"at "<<i<<endl;

while(low<=high){

//cout<<"low high = "<<low<<" "<<high<<endl;

mid = (low+high)/2;

if(d[mid]*1.0/d[i]<=2){

low = mid+1;

tmp_ans = mid;

}else{

high = mid-1;

}

}

if(tmp_ans!=-1){

ans = max(tmp_ans - i+1, ans);

}

}

//cout<<"ans = "<<ans<<endl;

cout<<N-ans<<endl;

}

int main(){

cin>>N;

for(int i=0; i<N; i++){

cin>>d[i];

}

sort(d, d+N);

work();

return 0;

}