Submission #1151457

#TimeUsernameProblemLanguageResultExecution timeMemory
1151457ezzzayLet's Win the Election (JOI22_ho_t3)C++20
5 / 100
1 ms328 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
int a[N];
int b[N];
signed main(){
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
	vector<int>v;
	for(int i=1;i<=n;i++){
		v.pb(a[i]);
	}
	int s=0;
	sort(v.begin(),v.end());
	for(int i=0;i<k;i++){
		s+=v[i];
	}
	cout<<fixed<<setprecision(10)<<double(s)<<endl;;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...