# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328742 | luciocf | Hiring (IOI09_hiring) | C++14 | 1599 ms | 4204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 5e5+10;
int n;
ll w;
pii a[maxn];
bool comp(pii a, pii b)
{
return 1ll*a.ff*b.ss < 1ll*b.ff*a.ss;
}
int main(void)
{
scanf("%d %lld", &n, &w);
for (int i = 1; i <= n; i++)
scanf("%d %d", &a[i].ff, &a[i].ss);
sort(a+1, a+n+1, comp);
int ans = 1;
for (int i = 2; i <= n && a[i].ff <= w; i++)
{
int aux = 1;
ll tot = a[i].ss;
sort(a+1, a+i, [&] (pii a, pii b) {return a.ss < b.ss;});
for (int j = 1; j < i; j++)
{
tot += 1ll*a[j].ss;
if (1ll*tot*a[i].ff > 1ll*w*a[i].ss) break;
++aux;
}
ans = max(ans, aux);
}
printf("%d\n", ans);
for (int i = 1; i <= ans; i++)
printf("1\n");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |