225562026-01-15 11:07:24KoszorusBlankaBányász RPG (40 pont)cpp17Time limit exceeded 36/40400ms1088 KiB
#include <bits/stdc++.h>
using namespace std;
struct par
{
    int t,db;
};
par a[100001];
int n;
bool rendez(par x,par y)
{
    return x.t<y.t;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i].t;
    for(int i=1;i<=n;i++) cin>>a[i].db;
    sort(a+1,a+n+1,rendez);
   // for(int i=1;i<=n;i++)cout<<a[i].t<<" "<<a[i].db<<",";
    int szint = 0;
    int cel_szint;
    int j = n;
    int i = 1;
    int ido = 0;
    while (i <= j) {
         cel_szint = a[i].t;
         while (szint < cel_szint) {
            a[j].db--; szint++; ido = ido+2;
            if (a[j].db == 0) j--;
         }
         ido += a[i].db; szint += a[i].db;
         i++;
    }

    cout << ido;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/40
1Accepted0/01ms316 KiB
2Accepted0/012ms504 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/28ms508 KiB
6Accepted2/218ms648 KiB
7Accepted2/23ms412 KiB
8Accepted2/24ms500 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms500 KiB
11Accepted3/31ms388 KiB
12Accepted3/31ms316 KiB
13Accepted4/41ms316 KiB
14Accepted4/41ms316 KiB
15Time limit exceeded0/2400ms632 KiB
16Accepted2/248ms856 KiB
17Time limit exceeded0/2400ms828 KiB
18Accepted2/264ms1088 KiB