# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
477964 | mychecksedad | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;
int n;
ll sum = 0, a, b[N];
pair<ll, ll> arr[N];
void solve(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> a >> arr[i].first;
b[i] = arr[i].first;
arr[i].second = i;
sum += a;
b[i] = 0;
}
sort(arr, arr+n);
int ans = 0;
for(int i = n - 1; i >= 0; --i){
if(arr[i].first <= sum){
sum -= arr[i].first;
b[arr[i].second] = arr[i].first;
}else{
b[arr[i].second] = sum;
sum = 0;
}
if(sum == 0) break;
}
for(int i = 0; i < n; ++i) if(b[i] == 0) ++ans;
cout << ans << '\n';
for(int i = 0; i < n; ++i) cout << b[i] << ' ';
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |