oj.uz

답안 #844386

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844386 2023-09-05T12:52:48 Z vjudge1 Pod starim krovovima (COCI20_psk) C++11
40 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>
#define lg(a) (31 - __builtin_clz((a)))
#define endl ("\n")
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define vi vector<int>
#define all(aa) aa.begin(), aa.end()
#define rall(aa) aa.rbegin(), aa.rend()
#define forn(i, n) for(int i=0;i<n;i++)
#define trav(e, x) for(auto& e:x)
#define until(n, v) (int) (lower_bound(v.begin(), v.end(), n)-v.begin()) //# of elements < n
#define after(n, v) (int) (v.end()-upper_bound(v.begin(), v.end(), n))   //# of elements > n
#define sameas(n, v) (int) (upper_bound(v.begin(), v.end(), n) - lower_bound(v.begin(), v.end(), n)) //# of elements ==n
typedef long long ll;

using namespace std;
/*

*/




void solve(){
	int n; cin>>n;
	vector<pair<ll, ll>> V(n);
	vector<ll> L(n);
	for(int i=0;i<n;i++){
		ll l, v;
		cin >> l >> v;
		L[i] = l, V[i] = mp(v, i);
	}
	ll liq = accumulate(all(L), 0);
	sort(rall(V));
	vector<ll> ans(n, 0);
	int empty=n;
	for(int i=0; liq>0 and i<n;i++){
		ans[V[i].second] = min(liq, V[i].first); empty--;
		liq-=min(liq, V[i].first);
	}
	cout<<empty<<endl;
	for(auto e: ans) cout<<e<<' ';
}

int main(){
	solve();
}

Subtask #1
40.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Incorrect 1 ms 348 KB Output isn't correct