# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456350 | chunghan | Hiring (IOI09_hiring) | C++17 | 443 ms | 18288 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>
using namespace std;
using ll = long long;
ll N, W, sum, rst;
double psum = 1e18;
pair<pair<ll, ll>, int> D[500005];
pair<pair<ll, ll>, int> max_k;
priority_queue<pair<pair<ll, ll>, int>, vector<pair<pair<ll, ll>, int>>, less<pair<pair<ll, ll>, int>>> pq;
bool cmp(pair<pair<ll, ll>, int> a, pair<pair<ll, ll>, int> b) {
pair<ll, ll> x = a.first, y = b.first;
return x.first * y.second > y.first * x.second;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> W;
for (int i = 0; i < N; i++) {
int q, s;
cin >> s >> q;
D[i] = {{q, s}, i};
}
sort(D, D+N, cmp);
for (int i = 0; i < N; i++) {
pair<ll, ll> E = D[i].first;
ll Q = E.first, S = E.second;
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... |