#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);
}
for(auto &e:L) cin>>e;
ll liq = accumulate(all(L), 0);
sort(rall(V));
vector<ll> ans(n, 0);
int empty=n;
for(int i=0; liq>0;i++){
ans[V[i].second] = min(liq, V[i].first); empty--;
liq-=min(liq, V[i].first);
empty--;
}
cout<<empty<<endl;
for(auto e: ans) cout<<e<<' ';
}
int main(){
solve();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Integer -1 violates the range [0, 9] |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
344 KB |
Integer -3 violates the range [0, 23] |
| 5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
600 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
344 KB |
Integer -90 violates the range [0, 1000] |
| 9 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
