Submission #534275

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
534275	2022-03-08T02:57:20 Z	PikaQ	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	8 ms	336 KB

Main

#include<bits/stdc++.h>
#define forn(i,n) for(int i = 0;i < (n);i++)
#define Forn(i,n) for(int i = 1;i <= (n);i++)
#define all(p) p.begin(),p.end()
#define pb push_back
#define F first
#define S second
#define rz resize
#define sz(x) x.size()
#define int long long
#define vi vector<int>
#define pii pair<int,int>
using namespace std;
const int INF = 5000009;
 
int n,k;
vector<pii> a;
 
bool cmp(pii x,pii y){
	return (x.F < y.F || (x.F == y.F && x.S < y.S));
}
 
void solve(){
	cin >> n >> k;
	n++;
	a.rz(n);
	vi c(n);
	forn(i,n){ 
		if(i == n-1){
			c[n-1] = INF;
			a[n-1].S = INF,a[n-1].F = INF;
		}
		cin >> a[i].S >> a[i].F;
		c[i] = a[i].S;
		if(a[i].F == -1) a[i].F = INF;
	}
	
	sort(all(c));
	sort(all(a),cmp);	
	double ans = 0;
	forn(i,k) ans += c[i];
	double res = 0;
	for(int i = 1;i <= k;i++){
		res += (double)a[i-1].F/(i);
		vi b;
		for(int j = i;j < n;j++){
			b.pb(a[j].S);
		}
		sort(all(b));
		double tr = 0;
		for(int r = 0;r < k-i;r++){
			tr += b[r];
		}
		//cout << res << ' ' << tr << ' ' << (double)tr/(i+1) << '\n';
		ans = min(ans,(double) res + (double)tr / (i+1));
	}
	cout << ans << '\n';
}
 
signed main(){
	cin.tie(NULL);
	cout.tie(NULL);
	ios_base::sync_with_stdio(0);
	cout << fixed << setprecision(4);
	solve();
	return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

5.0 / 5.0

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

Subtask #3

0 / 11.0

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

Subtask #7

0 / 23.0

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