# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
844373 | 2023-09-05T12:46:35 Z | vjudge1 | Pod starim krovovima (COCI20_psk) | C++17 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define int long long main(){ int n;cin>>n; int tot = 0; vector<pair<int,int>> arr(n); for (int i = 0; i < n; ++i) { int x;cin>>x; tot+=x; cin>>arr[i].first; arr[i].second=i; } sort(arr.rbegin(), arr.rend()); vector<int> ans(n); int kk = 0; for (int i = 0; i < n; i++){ int ver = min(arr[i].first,tot); tot-=ver; if (ver==0) kk++; ans[arr[i].second]=ver; } cout<<kk<<endl; for (int i = 0; i < n; ++i) { cout<<ans[i]<<" "; } cout<<endl; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 344 KB | Output is correct |