牛客47744828号 
获赞
3
粉丝
2
关注
0
看过 TA
13
Ohio State University Columbus 2023 算法工程师 IP属地：新加坡暂未填写个人简介
MingxZH：#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> original(n);
for (int i = 0; i < n; i++) {
cin >> original[i];
}
sort(original.begin(), original.end());
int m;
cin >> m;
int maxc = 1, money = original[0];
int i = 0, j = 1;
int cost = 0;
while (j < n) {
while (j < n &;&; cost + (original[j] - original[j - 1]) * (j - i) <= m) {
cost += (original[j] - original[j - 1]) * (j - i);
j++;
}
if (j - i > maxc) {
maxc = j - i;
money = original[j - 1];
}
cost -= original[j - 1] - original[i];
i++;
}
cout << maxc << endl;
cout << money << endl;
return 0;
}
0 点赞 评论 收藏
分享
创作者周榜
更多
关注他的用户也关注了：