Codeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Final)

Codeforces Round #681 (Div. 2, based on VK Cup 2019-2020 - Final)

A. Kids Seating

#include<bits/stdc++.h>
using namespace std;

void solve()
{
    int n;
    cin>>n;
    int res=4*n-2;
    for(int i=1;i<=n;i++)
    {
        cout<<res<<" ";
        res-=2;
    }
    cout<<endl;
}
signed main(){
 
    int _=1;
    cin>>_;
    while(_--)
    {
        solve();
    }
    return 0;
}

B. Saving the City

#include <bits/stdc++.h>

#define int ll
//#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 3e4 + 10;

int a[maxn];

void solve() {
    int a, b, z = -1,ans=0;
    cin >> a >> b;
    string s;
    cin >> s;
    for (int i = 0; i < s.size(); i++)
        if (s[i] == '1') {
            if (z < 0) ans+=a;
            else ans+=min(a,b*(i-z-1));
            z=i;
        }
    cout<<ans<<"\n";
}

signed main() {
    //ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

C. The Delivery Dilemma

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;

void init() {

}

struct node {
    int a, b;
} c[maxn];

bool cmp(node a,node b){
    return a.a>b.a;
}

void solve() {
    int n;
    int su=0;
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> c[i].a;
    for (int i = 0; i < n; i++)cin >> c[i].b,su+=c[i].b;
    sort(c,c+n,cmp);
    int sum=0,ans=c[0].a;
    for(int i=0;i<n;i++){
        if(sum+c[i].b<c[i].a) sum+=c[i].b;
        else {
            ans=c[i].a;
            break;
        }
    }
    ans=max(sum,ans);
    if(su==sum) ans=su;
    cout<<ans<<"\n";
}

signed main() {

    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

D. Extreme Subtraction

#include <bits/stdc++.h>

#define int ll
//#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int maxn = 3e4 + 10;

int a[maxn];

void solve() {
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i];
    int ans=0;
    for(int i=1;i<n;i++)
        if(a[i]<a[i-1]) ans+=a[i-1]-a[i];
    cout<<(a[0]>=ans?"YES":"NO")<<"\n";
}

signed main() {
    //ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}