Submission #1163535

#	Time	Username	Problem	Language	Result	Execution time	Memory
1163535		i271828	Akcija (COCI21_akcija)	C++20	0 / 110	1 ms	328 KiB

Main

#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);
	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';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 30
• Subtask 6: 0 / 20