#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fs first
#define sc second
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
ll k;
cin >> n >> k;
vector<pair<int, int>> a(n);
vector<int> ord(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].sc >> a[i].fs;
ord[i] = i;
}
sort(ord.begin(), ord.end(), [&](int & x, int & y){
if (a[x].fs * a[y].sc == a[x].sc * a[y].fs) return a[x].sc < a[y].sc;
return (a[y].fs * a[x].sc <= a[y].sc * a[x].fs);
});
set<pair<int, int>> st;
int ans = 0, at = 0;
ll cs = 0;
ll tcb = 1, tct = 0;
for (int i = 0; i < n; ++i) {
int x = a[ord[i]].fs, y = a[ord[i]].sc;
cs += x;
st.insert({x, i});
while (cs * y > k * x) {
pair<int, int> v = *st.rbegin();
cs -= v.fs;
st.erase(v);
}
if (st.size() > ans) {
ans = st.size();
tct = cs * y;
tcb = x;
at = i;
} else if (cs * y * tcb > tct * x && st.size() == ans) {
tct = cs * y;
tcb = x;
at = i;
}
}
st.clear();
cs = 0;
for (int i = 0; i < n; ++i) {
int x = a[ord[i]].fs, y = a[ord[i]].sc;
cs += x;
st.insert({x, ord[i]});
while (cs * y > k * x) {
pair<int, int> v = *st.rbegin();
cs -= v.fs;
st.erase(v);
}
if (at == i) {
cout << ans << "\n";
for (auto v: st) {
cout << v.sc + 1 << "\n";
}
return 0;
}
}
assert(false);
return 0;
}
Compilation message
hiring.cpp: In function 'int main()':
hiring.cpp:44:17: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
44 | if (st.size() > ans) {
| ~~~~~~~~~~^~~~~
hiring.cpp:49:50: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
49 | } else if (cs * y * tcb > tct * x && st.size() == ans) {
| ~~~~~~~~~~^~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Partially correct |
3 |
Partially correct |
0 ms |
348 KB |
Partially correct |
4 |
Partially correct |
0 ms |
348 KB |
Partially correct |
5 |
Partially correct |
1 ms |
348 KB |
Partially correct |
6 |
Partially correct |
2 ms |
348 KB |
Partially correct |
7 |
Partially correct |
1 ms |
472 KB |
Partially correct |
8 |
Partially correct |
2 ms |
352 KB |
Partially correct |
9 |
Correct |
3 ms |
600 KB |
Output is correct |
10 |
Partially correct |
3 ms |
604 KB |
Partially correct |
11 |
Partially correct |
3 ms |
756 KB |
Partially correct |
12 |
Partially correct |
4 ms |
720 KB |
Partially correct |
13 |
Partially correct |
4 ms |
468 KB |
Partially correct |
14 |
Correct |
7 ms |
856 KB |
Output is correct |
15 |
Partially correct |
8 ms |
856 KB |
Partially correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Partially correct |
1 ms |
344 KB |
Partially correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Partially correct |
10 ms |
1216 KB |
Partially correct |
5 |
Partially correct |
23 ms |
2136 KB |
Partially correct |
6 |
Correct |
255 ms |
11220 KB |
Output is correct |
7 |
Partially correct |
286 ms |
15588 KB |
Partially correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
348 KB |
Partially correct |
2 |
Partially correct |
1 ms |
348 KB |
Partially correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
348 KB |
Partially correct |
2 |
Partially correct |
1 ms |
344 KB |
Partially correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
1 ms |
348 KB |
Partially correct |
2 |
Partially correct |
1 ms |
348 KB |
Partially correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
87 ms |
4592 KB |
Partially correct |
2 |
Partially correct |
81 ms |
4448 KB |
Partially correct |
3 |
Correct |
88 ms |
4424 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
106 ms |
7620 KB |
Partially correct |
2 |
Partially correct |
109 ms |
7660 KB |
Partially correct |
3 |
Correct |
133 ms |
7760 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
380 ms |
17232 KB |
Output is correct |
2 |
Partially correct |
377 ms |
16916 KB |
Partially correct |
3 |
Correct |
369 ms |
17100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
531 ms |
20220 KB |
Output is correct |
2 |
Partially correct |
488 ms |
20216 KB |
Partially correct |
3 |
Correct |
491 ms |
20080 KB |
Output is correct |