#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;
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)
{
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());
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
2 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
5 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
6 |
Partially correct |
1 ms |
4568 KB |
Partially correct |
7 |
Partially correct |
2 ms |
4444 KB |
Partially correct |
8 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
9 |
Correct |
2 ms |
4588 KB |
Output is correct |
10 |
Partially correct |
3 ms |
4700 KB |
Partially correct |
11 |
Correct |
3 ms |
4444 KB |
Output is correct |
12 |
Partially correct |
4 ms |
4696 KB |
Partially correct |
13 |
Partially correct |
3 ms |
4444 KB |
Partially correct |
14 |
Correct |
7 ms |
4696 KB |
Output is correct |
15 |
Partially correct |
7 ms |
4700 KB |
Partially correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
Output is correct |
2 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Partially correct |
8 ms |
4700 KB |
Partially correct |
5 |
Partially correct |
21 ms |
9196 KB |
Partially correct |
6 |
Correct |
150 ms |
11852 KB |
Output is correct |
7 |
Partially correct |
222 ms |
14856 KB |
Partially correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
2 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
Output is correct |
2 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
3 |
Correct |
1 ms |
4440 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4444 KB |
Output is correct |
2 |
Partially correct |
1 ms |
4444 KB |
Partially correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
57 ms |
10460 KB |
Partially correct |
2 |
Partially correct |
58 ms |
10968 KB |
Partially correct |
3 |
Correct |
58 ms |
9892 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
102 ms |
10992 KB |
Partially correct |
2 |
Partially correct |
90 ms |
11120 KB |
Partially correct |
3 |
Correct |
89 ms |
11092 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
242 ms |
16572 KB |
Output is correct |
2 |
Partially correct |
245 ms |
17840 KB |
Partially correct |
3 |
Correct |
261 ms |
18336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
295 ms |
16572 KB |
Output is correct |
2 |
Partially correct |
289 ms |
18384 KB |
Partially correct |
3 |
Correct |
280 ms |
16312 KB |
Output is correct |