제출 #1281107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281107		SmuggingSpun	Let's Win the Election (JOI22_ho_t3)	C++20	5 / 100	1 ms	348 KiB

Main

#include<bits/stdc++.h>
#define taskname "c"
using namespace std;
const int lim = 505;
template<class T>void minimize(T& a, T b){
	if(a > b){
		a = b;
	}
}
int n, k, a[lim], b[lim];
namespace sub12{
	void solve(){
		vector<int>p;
		for(int i = 1; i <= n; i++){
			if(b[i] != -1){
				p.push_back(i);
			}
		}
		double ans = 0;
		vector<int>I(n);
		iota(I.begin(), I.end(), 1);
		sort(I.begin(), I.end(), [&] (int i, int j){
			return a[i] < a[j];
		});
		for(int i = 0; i < k; i++){
			ans += a[I[i]];
		}
		vector<bool>vis(n + 1, false);
		double sum = 0;
		for(int i = 0; i < min(int(p.size()), k); i++){
			vis[p[i]] = true;
			sum += double(b[p[i]]) / double(i + 1);
			double current = 0;
			int cnt = i + 1;
			for(int& j : I){
				if(cnt == k){
					break;
				}
				if(!vis[j]){
					current += double(a[j]) / double(i + 2);
					cnt++;
				}
			}
			if(cnt == k){
				minimize(ans, current + sum);
			}
		}
		cout << ans;
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> n >> k;
	bool is_sub12 = true;
	for(int i = 1; i <= n; i++){
		cin >> a[i] >> b[i];
		if(b[i] != -1 && a[i] != b[i]){
			is_sub12 = false;
		}
	}
	if(is_sub12){
		sub12::solve();
	}
	else{
	}
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:54:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23