oj.uz

Submission #201073

# Submission time Handle Problem Language Result Execution time Memory
201073 2020-02-09T09:37:22 Z mraron Pod starim krovovima (COCI20_psk) C++14
50 / 50
 5 ms 380 KB 
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<random>
#include<chrono>
#include<bitset>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define mp make_pair

#ifndef ONLINE_JUDGE
#  define LOG(x) (cerr << #x << " = " << (x) << endl)
#else
#  define LOG(x) ((void)0)
#endif

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const double PI=3.1415926535897932384626433832795;
const ll INF = 1LL<<62;
const ll MINF = -1LL<<62;

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

	do {
		val=(val*10)+c-'0';
	} while((c=gc()) && (c>='0' && c<='9'));

	return val*(neg?-1:1);
}

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); uniform_int_distribution<int>(0, n-1)(rng)



int main() {
	IO;
	int n;
	cin>>n;
	vector<pair<ll,ll>> t(n);
	ll sum=0;
	for(int i=0;i<n;++i) {
		cin>>t[i].xx>>t[i].yy;
		sum+=t[i].xx;
	}
	
	vector<int> ord;
	
	for(int i=0;i<n;++i) ord.push_back(i);
	sort(ord.begin(),ord.end(),[&](int x, int y) -> bool {
		return t[x].yy>t[y].yy;
	});
	
	int ans=0;
	for(auto i:ord) {
		t[i].xx=min(sum, t[i].yy);
		ans+=t[i].xx==0;
		sum-=t[i].xx;
	}
	
	cout<<ans<<"\n";
	for(auto i:t) cout<<i.xx<<" ";
	cout<<"\n";
	return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct