1030. 完美数列(25)

挺好的一道题目。

// 2017/10/14 NCU // PAT-B 1053// scienceZ#include <cstdio>#include <cstring>#include <iostream>#include <cctype>#include <algorithm>using namespace std;int n, p, mymax;int arr[100010];int main(){    cin >> n >> p;    for (int i = 0; i<n; i++)   cin >> arr[i];    sort(arr, arr+n);    for (int i = 0; i<n; i++){        for(int j = i+mymax; j<n; j++){            if(float(arr[j])/arr[i]<=p) mymax++;            else break;                 }    }    cout << mymax;    return 0;}