# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
256239 | 2020-08-02T11:50:33 Z | blacktulip | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 396 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define endl "\n" #define int long long #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; multiset<int> st; vector<int> v; PII p[li]; main(void){ scanf("%lld",&n); FOR{ int x; scanf("%lld %lld",&x,&p[i].fi); st.insert(x); p[i].se=i; } sort(p+1,p+n+1); reverse(p+1,p+n+1); FOR{ auto it=st.end(); if(it==st.begin() || p[i].fi==0){continue;} it--; int at=min(p[i].fi,*it); a[p[i].se]+=at; p[i].fi-=at; int bt=*it; st.erase(it); if(bt>at)st.insert(bt-at); i--; } FOR{ if(a[i]==0)cev++; } printf("%lld\n",cev); FOR printf("%lld ",a[i]); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 0 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 384 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 396 KB | Output is correct |