제출 #1295465

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

Main

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    cin>>n>>k;
    int A[n],B[n];
    vector<vector<int>>ord;
    vector<int>c,ck;
    for(int i = 0;i<n;i++){
    	cin>>A[i]>>B[i];
    	ord.pb({A[i],B[i]});
    }
    sort(all(ord));
    long double time = 0;
    int mem = 1;
    for(int i = 0;i<k;i++){
    	if(ord[i][1] == -1){
    		c.pb(ord[i][0]);
    	}
    	else{
    		ck.pb(ord[i][0]);

    	}
    }
    sort(all(ck));
    
    for(int i:ck){
    	time+=i/mem;
    	mem++;    	
    }
    for(auto i:c){
    	time+=i/mem;
    }
    
    cout<<time<<endl;
}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• 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