Submission #1163539

#TimeUsernameProblemLanguageResultExecution timeMemory
1163539i271828Akcija (COCI21_akcija)C++20
10 / 110
2 ms328 KiB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int MAX=2005;

bool comp(pii a,pii b){
	if (a.second==b.second) return a.first<b.first;
	return a.second<b.second;
}

int N=4;
int K=3;
pii prods[MAX]={};
int W[MAX];
int D[MAX];

int main(){
	cin>>N>>K;
	for (int i=0;i<N;i++) cin>>prods[i].first>>prods[i].second;
	sort(prods,prods+N,comp);
	for (int i=0;i<N;i++){
		W[i]=prods[i].first;
		D[i]=prods[i].second;
	}
	ll w=0;
	int c=0;
	int t=1;
	for (int i=0;i<N;i++){
		if (t<=D[i]){
			c++;
			w+=W[i];
			t++;
		}
	}
	cout<<c<<' '<<w<<'\n';
}
#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...