tips:the chinese problem is the basic level of pat ,neverthless And it makes sense that it is
put under the dir of pat.
/* firstly: sort the array using the algorithm "sort" secondly: traverse all the possible answer and find the most suitable one. */ #include<iostream> #include<vector> #include<algorithm> using namespace std; int main() { long long int n,p; vector<long long int> v; while (cin>>n>>p) { long long int temp; while (n--) { cin>>temp; v.push_back(temp); } sort(v.begin(),v.end()); long long int max = -1; for (int i = 0; i < v.size(); i++) { long long int count = 1; for (int j = i + 1; j < v.size(); j++) { if (v[i] * p >= v[j]) count += 1; else break; } if (count >= max) { max = count ; } } cout<<max<<endl; } }
and i’m very sorry that one example is time running out. maybe there are some parts of
code which can be optimized ,however i think it can be left to my reader.
时间: 2024-10-08 18:00:05