oj.uz

답안 #844310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
844310 2023-09-05T12:13:56 Z vjudge1 Pod starim krovovima (COCI20_psk) C++17
50 / 50
 1 ms 348 KB 
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define endl "\n" 
#define int long long
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
void solve()
{
  int n;
  cin >> n;
  vector<array<int,3>> ans;
  int go[n+1];
  memset(go,0,sizeof(go));
  int hm=0;
  for(int i=1;i<=n;i++)
  {
   int a,b;
   cin >> a >> b;
   hm+=a;
   ans.pb({b,a,i});
  }
  
  sort(rall(ans));
  
  for(int i=0;i<n;i++)
  {
    if(hm>ans[i][0])
    {
      hm-=ans[i][0];
      go[ans[i][2]]=ans[i][0];
    }
    else
    {
      go[ans[i][2]]=hm;
      break;
    }
  }


  int sum=0;
  for(int i=1;i<=n;i++) sum+=(go[i]==0);
  cout << sum << endl;
  for(int i=1;i<=n;i++) cout << go[i] << " \n"[i==n]; 
}

int32_t main(){

  cin.tie(0); ios::sync_with_stdio(0);
  
  int t=1;//cin >> t;
  while(t--) solve();

  return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 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 0 ms 348 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 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct