oj.uz

답안 #686646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
686646 2023-01-25T16:34:07 Z Farhan_HY Pod starim krovovima (COCI20_psk) C++14
50 / 50
 1 ms 352 KB 
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

const int N = 1e6 + 5;
const int M = 1e3 + 3;
const int inf = 1e18;
const int mod = 1e9 + 7;
int a[N], n;
pair<int, int> p[N];

bool cmp(const int &x, const int &y) {
    return p[x].S > p[y].S;
}

main() {
    IOS
    cin >> n;
    int sum = 0;
    for(int i = 1; i <= n; i++)
        cin >> p[i].F >> p[i].S, a[i] = i, sum += p[i].F;
    sort(a + 1, a + n + 1, cmp);
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        int d = min(sum, p[a[i]].S);
        sum -= d;
        p[a[i]].F = d;
        ans += p[a[i]].F == 0;
    }
    cout << ans << '\n';
    for(int i = 1; i <= n; i++) cout << p[i].F << ' ';
}

Compilation message

psk.cpp:20:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   20 | main() {
      | ^~~~

Subtask #1
50.0 / 50.0

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