제출 #1234336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1234336		PlayVoltz	Pod starim krovovima (COCI20_psk)	C++20	0 / 100	0 ms	320 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

struct trio{
	int a, b, i;
};

bool custom(trio a, trio b){
	return a.b>b.b;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, sum=0, res;
	cin>>n, res=n;
	vector<trio> vect(n);
	vector<int> ans(n, 0);
	for (int i=0; i<n; ++i)cin>>vect[i].a>>vect[i].b, vect[i].i=i, sum+=vect[i].a;
	sort(vect.begin(), vect.end(), custom);
	for (int i=0; i<n; ++i){
		if (!sum)break;
		--res;
		ans[vect[i].i]=min(sum, vect[i].b);
		sum-=min(sum, vect[i].b);
	}
	cout<<res<<"\n";
	for (auto a:ans)cout<<a<<" ";
}

• Subtask 1: 0 / 100