博客几种可选代码配色方案 

autumn
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}



emacs
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
 
colorful
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
 
perldoc
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
pastie
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
manni
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
Monokai
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];

int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}
 
?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
使用SyntaxHighlighter更改的配色
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int p[maxn],a[maxn],b[maxn];
bool vis[maxn];
set<pair<int,int> >s[5];
 
int main()
{
    int n,m,t;
    scanf("%d",&n);
    for (int i = 0;i < n;i++)    scanf("%d",&p[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&a[i]);
    for (int i = 0;i < n;i++)    scanf("%d",&b[i]);
    for (int i = 0;i < n;i++)
    {
        s[a[i]].insert(make_pair(p[i],i));
        s[b[i]].insert(make_pair(p[i],i));
        vis[i] = true;
    }
    scanf("%d",&m);
    while (m--)
    {
        int ans = -1;
        scanf("%d",&t);
        while (!s[t].empty())
        {
            int pos = (*(s[t].begin())).second;
            s[t].erase(s[t].begin());
            if (!vis[pos])  continue;
            ans = p[pos];
            vis[pos] = false;
            break;
        }
        printf("%d ",ans);
    }
    puts(" ");
    return 0;
}

　　

posted @   zxzhang  阅读(706)  评论(0)  编辑  收藏  举报
编辑推荐：
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列：如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· Linux系列：如何用 C#调用 C方法造成内存泄露
阅读排行：
· 震惊！C++程序真的从main开始吗？99%的程序员都答错了
· 别再用vector＜bool＞了！Google高级工程师：这可能是STL最大的设计失误
· 单元测试从入门到精通
· 【硬核科普】Trae如何「偷看」你的代码？零基础破解AI编程运行原理
· 上周热点回顾（3.3-3.9）
点击右上角即可分享
微信分享提示