oj.uz

답안 #440532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
440532 2021-07-02T11:31:28 Z Abrar_Al_Samit Pod starim krovovima (COCI20_psk) C++17
50 / 50
 1 ms 332 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;


#define debug(x) cerr << '[' << (#x) << "] = " << x << '\n';

template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ;

void PlayGround() {
    int n; cin >> n;
    long long sum = 0;
    vector<pair<long long, long long>>vol(n);
    for(int i=0; i<n; ++i) {
        int x; cin >> x;
        sum += x;
        cin >> vol[i].first;
        vol[i].second = i;
    }
    sort(vol.rbegin(), vol.rend());

    vector<long long>config(n);
    long long ans = 0;
    for(int i=0; i<n; ++i) {
        int cur = min(sum, vol[i].first);
        if(cur==0) ++ans;
        sum -= cur;
        config[vol[i].second] = cur;
    }
    cout << ans << '\n';
    for(auto it : config) cout << it << ' ';
    cout << '\n';


    #ifndef ONLINE_JUDGE
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
} 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    // #endif
    PlayGround();

    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct