#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define tof_io ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double long double
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'
const int mod = 998244353; //998244353 1e9+7 1e9+9
const int inf = 1e18;
const int N = 1e5 + 23;
const int lg = 23;
int fac[N];
int inv[N];
int dnt_pow (int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld (){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int dnt_ncr (int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
int32_t main()
{
int n;
cin >> n;
vector<int> vall(n);
unsigned sum = 0;
for(int i = 0; i < n; i++)
{
int t , z;
cin >> t >> z;
sum = sum + t;
vall[i] = z;
}
sort(all(vall));
reverse(all(vall));
vector<int> ans(n);
int cnt = 0;
for(int i = 0; i < n; i++)
{
if(sum >= vall[i])
{
ans[i] = vall[i];
sum = sum - vall[i];
}
else
{
ans[i] = sum;
sum = 0;
}
if(ans[i] == 0) cnt++;
}
cout << cnt << endl;
for(int i = 0; i < n; i++)
{
cout << ans[i] <<' ';
}
}
| # |
Verdict |
Execution time |
Memory |
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 |
Partially correct |
0 ms |
348 KB |
Output is partially correct |
| 6 |
Partially correct |
0 ms |
348 KB |
Output is partially correct |
| 7 |
Partially correct |
0 ms |
348 KB |
Output is partially correct |
| 8 |
Partially correct |
1 ms |
348 KB |
Output is partially correct |
| 9 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
