#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <set>
typedef long long llong;
const int MAXN = 500000 + 10;
const int INF = 1e9;
int n;
llong s[MAXN];
llong q[MAXN];
int perm[MAXN];
std::priority_queue <std::pair <llong,int>> pq;
llong sum;
llong w;
void solve()
{
std::iota(perm + 1, perm + 1 + n, 1);
std::sort(perm + 1, perm + 1 + n, [&](int x, int y)
{
return s[x] * q[y] < s[y] * q[x];
});
int ans = 0;
int cnt = 0;
int maxPos = 0;
double minMoney = 0;
for (int i = 1 ; i <= n ; ++i)
{
pq.push({q[perm[i]], perm[i]});
sum += q[perm[i]];
cnt++;
while (sum * s[perm[i]] > w * q[perm[i]])
{
cnt--;
sum -= pq.top().first;
pq.pop();
}
if (cnt > ans || (cnt == ans && (double)(sum * s[perm[i]]) / q[perm[i]] < minMoney))
{
minMoney = (double)(sum * s[perm[i]]) / q[perm[i]];
maxPos = i;
ans = cnt;
}
}
while (pq.size())
{
pq.pop();
}
sum = 0;
cnt = 0;
std::cout << ans << '\n';
for (int i = 1 ; i <= maxPos ; ++i)
{
pq.push({q[perm[i]], perm[i]});
sum += q[perm[i]];
cnt++;
while (sum * s[perm[i]] > w * q[perm[i]])
{
cnt--;
sum -= pq.top().first;
pq.pop();
}
}
std::vector <int> sol;
while (pq.size())
{
sol.push_back(pq.top().second);
// std::cout << pq.top().second << '\n';
pq.pop();
}
std::sort(sol.begin(), sol.end());
// long double
for (const int &idx : sol)
{
std::cout << idx << '\n';
}
}
void input()
{
std::cin >> n >> w;
for (int i = 1 ; i <= n ; ++i)
{
std::cin >> s[i] >> q[i];
}
}
void fastIOI()
{
std::ios_base :: sync_with_stdio(0);
std::cout.tie(nullptr);
std::cin.tie(nullptr);
}
int main()
{
fastIOI();
input();
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Correct |
1 ms |
4596 KB |
Output is correct |
5 |
Correct |
1 ms |
4444 KB |
Output is correct |
6 |
Correct |
1 ms |
4444 KB |
Output is correct |
7 |
Correct |
1 ms |
4444 KB |
Output is correct |
8 |
Correct |
1 ms |
4444 KB |
Output is correct |
9 |
Correct |
2 ms |
4444 KB |
Output is correct |
10 |
Correct |
3 ms |
4704 KB |
Output is correct |
11 |
Correct |
3 ms |
4444 KB |
Output is correct |
12 |
Correct |
4 ms |
4820 KB |
Output is correct |
13 |
Correct |
3 ms |
4444 KB |
Output is correct |
14 |
Correct |
6 ms |
4828 KB |
Output is correct |
15 |
Correct |
6 ms |
4700 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Correct |
9 ms |
4700 KB |
Output is correct |
5 |
Correct |
21 ms |
9168 KB |
Output is correct |
6 |
Correct |
153 ms |
12292 KB |
Output is correct |
7 |
Correct |
208 ms |
14680 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
56 ms |
10452 KB |
Output is correct |
2 |
Correct |
57 ms |
10704 KB |
Output is correct |
3 |
Correct |
57 ms |
9940 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
89 ms |
10956 KB |
Output is correct |
2 |
Correct |
89 ms |
11036 KB |
Output is correct |
3 |
Correct |
94 ms |
11032 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
245 ms |
16064 KB |
Output is correct |
2 |
Correct |
242 ms |
17108 KB |
Output is correct |
3 |
Correct |
245 ms |
17880 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
323 ms |
16608 KB |
Output is correct |
2 |
Correct |
285 ms |
17260 KB |
Output is correct |
3 |
Correct |
276 ms |
16448 KB |
Output is correct |