Submission #527686

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
527686	2022-02-18T02:57:09 Z	8e7	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	6 ms	332 KB

Main

//Challenge: Accepted
#include <bits/stdc++.h>
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 505
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
pii a[maxn];
int main() {
	io
	int n, k;
	cin >> n >> k;

	for (int i = 0;i < n;i++) {
		cin >> a[i].ff >> a[i].ss; 	
		if (a[i].ss == -1) a[i].ss = 1<<30;
	}
	sort(a, a + n, [&] (pii x, pii y){return x.ss < y.ss;});
	double cur = 0, ans = 1e9;
	for (int i = 0;i < k;i++) {
		vector<pii> b;
		for (int j = n-1;j >= i;j--) {
			b.push_back(a[j]);
		}
		sort(b.begin(), b.end());
		double tmp = cur;
		for (int j = 0;j < k - i;j++) {
			tmp += (double)b[j].ff / (i + 1);	
		}
		//debug(i, cur, tmp);
		ans = min(ans, tmp);
		cur += (double)a[i].ss / (i+1);
	}
	ans = min(ans, cur);
	cout << fixed << setprecision(10) << ans << "\n";
}

Subtask #1

5.0 / 5.0

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

Subtask #2

5.0 / 5.0

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

Subtask #3

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	0 ms	204 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	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	0 ms	204 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	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Incorrect	0 ms	204 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 11.0

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