Submission #61825675

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() cout<<"come on"<<'\n'
struct edge{
  int p,k;
  bool operator <(const edge &x) const{
    return (2*k-1)*p!=(2*x.k-1)*x.p?(2*k-1)*p>(2*x.k-1)*x.p:k<x.k;
  }
};
int n,m,mm,ans;
priority_queue<edge> pq;
signed main(){
  cin>>n>>m;
  for(int i=1;i<=n;i++){
    int x;
    cin>>x;
    pq.push((edge){x,1});
  }
  while(mm<=m){
    edge x=pq.top();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() cout<<"come on"<<'\n'
struct edge{
	int p,k;
	bool operator <(const edge &x) const{
		return (2*k-1)*p!=(2*x.k-1)*x.p?(2*k-1)*p>(2*x.k-1)*x.p:k<x.k;
	}
};
int n,m,mm,ans;
priority_queue<edge> pq;
signed main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		pq.push((edge){x,1});
	}
	while(mm<=m){
		edge x=pq.top();
		pq.pop();
		if(x.p*(2*x.k-1)+mm>m)break;
		mm+=x.p*(2*x.k-1);
		x.k++,ans++;
		pq.push(x);
	}
	cout<<ans;
	return 0;
}

Submission Info

Judge Result