oj.uz

Submission #624899

# Submission time Handle Problem Language Result Execution time Memory
624899 2022-08-09T01:22:37 Z dooompy Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 8 ms 300 KB 
#include <bits/stdc++.h>

using namespace std;

vector<pair<int, int>> v;

int main() {
    int n, k; cin >> n >> k;
    for (int i = 0; i < n; i++) {
        int a, b; cin >> a >> b;
        if (b == -1) b = 1e9;
        v.emplace_back(a, b);
    }

    sort(v.begin(), v.end(), [](pair<int, int> a, pair<int, int> b) {
        if (a.second == b.second) {
            return a.first < b.first;
        }
        return a.second < b.second;
    });

    double ans = 2e9;

    for (int i = 0; i <= k; i++) {
        // take b up to here

        double total = 0;

        for (int j = 0; j < i; j++) {
            total += (double) (v[j].second) / (double) (j + 1);
        }

        vector<pair<int, int>> cur;
        for (int j = i; j < n; j++) {
            cur.push_back(v[j]);
        }

        sort(cur.begin(), cur.end());

        for (int j = 0; j < k - i; j++) {
            total += (double) (cur[j].first) / (double) (i + 1);
        }

        ans = min(ans, total);
    }

    cout << ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 296 KB Output is correct
10 Correct 3 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 296 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 4 ms 212 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 4 ms 300 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 300 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 300 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 1 ms 300 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 296 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 3 ms 296 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 4 ms 212 KB Output is correct
17 Correct 4 ms 300 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 4 ms 300 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Incorrect 1 ms 300 KB Output isn't correct
30 Halted 0 ms 0 KB -