# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
538722 | fabijan_cikac | Hiring (IOI09_hiring) | C++17 | 554 ms | 28508 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;
#define F first
#define S second
#define db double
#define pp pair<db, db>
#define ppp pair<db, pp>
int n; db w;
vector<db> sk;
vector<db> q;
vector<pair<db, int> > v;
multiset<pair<db, int> > s;
int siz = 0;
vector<int> sol;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> w;
sk.resize(n); q.resize(n);
for (int i = 0; i < n; ++i){
cin >> sk[i] >> q[i];
v.push_back({sk[i] / q[i], i});
}
sort(v.begin(), v.end()); db sum = 0;
for (int i = 0; i < n; ++i){
# | 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... |