oj.uz

답안 #640756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
640756 2022-09-15T07:42:05 Z ck_platypus Let's Win the Election (JOI22_ho_t3) C++14
0 / 100
 2500 ms 124152 KB 
#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
#include <bitset>
#include <climits>
#include <set>
#include <map>
#include <iomanip>
#include <queue>
#include <cstring>
#include <fstream>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define pii pair<int, int>
#define f first
#define s second
#define inf 1000000000000000
bool cmp2(pll a, pll b){
    return a.s<b.s;
}
bool cmp(pll a, pll b){
    return a.f<b.f;
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	ll n, k;
    cin >> n >> k;
    pll arr[n];
    ll cnt=n;
    for(int i=0;i<n;i++) cin >> arr[i].f >> arr[i].s;
    for(int i=0;i<n;i++){
        if(arr[i].s==-1){
            arr[i].s=500000;
            cnt--;
        }
    }
    for(int i=0;i<n;i++) arr[i].f*=1000000000000, arr[i].s*=1000000000000;
    ll ans=-1, cur, cool;
    for(int i=0;i<min(cnt+1, k);i++){
        cur=0;
        cool=0;
        sort(arr, arr+n, cmp2);
        for(int j=0;j<i;j++) cur+=arr[j].s/(j+1);
        sort(arr+i, arr+n, cmp);
        for(int j=i;j<k;j++) cool+=arr[j].f;
        cur+=cool/(i+1);
        if(ans==-1) ans=cur;
        else ans=min(ans, cur);
    }
    cout << ans/1000000000000 << ".";
    for(int i=0;i<11-log10(ans%1000000000000);i++) cout << "0";
    cout << ans%1000000000000 << endl;
    /*ll kkk=ans, kk=ans*10000;
    cout << kkk << ".";
    if(kk<10) cout << "000";
    else if(kk<100) cout << "00";
    else if(kk<1000) cout << "0";
    cout << kk%10000 << endl;*/
    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2590 ms 124152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2590 ms 124152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2584 ms 122468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2584 ms 122468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2584 ms 122468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2590 ms 124152 KB Time limit exceeded
2 Halted 0 ms 0 KB -