Submission #212059

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
212059	2020-03-22T07:57:25 Z	NONAME	Pod starim krovovima (COCI20_psk)	C++17	50 / 50	5 ms	384 KB

psk

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
 
vector <pair <ll, ll> > v;
ll a[N], b[N], ans, n, sm, i, j;
 
int main()
{
//    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//    in("input.txt");
//    out("output.txt");
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> a[i] >> b[i];
        v.pb({b[i], i});
        sm += a[i];
        a[i] = 0;
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    for (i = 0; i < v.size(); i++)
    {
        ll j = v[i].S;
        ll kl = min(b[j], sm);
        a[j] += kl;
        sm -= kl;
    }
    for (i = 1; i <= n; i++) ans += (a[i] == 0);
    cout << ans << el;
    for (i = 1; i <= n; i++) cout << a[i] << " ";
}

Compilation message

psk.cpp: In function 'int main()':
psk.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v.size(); i++)
                 ~~^~~~~~~~~~

Subtask #1

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct