zoukankan      html  css  js  c++  java
  • pair的使用

    #include<iostream>
    #include<cmath>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<string>
    #include<stack>
    #include<queue>
    #include<map>
    #include<cstdlib>
    #include<set>
    #include<ctime>
    #include<vector>
    #include<cstdio>
    #include<list>
    #include<sstream>
    //#include<regex>
    using namespace std;
    typedef long long ll;
    int INF=2147483647;
    int inf=-2147483648;
    #define read(x) scanf("%d",&x);
    #define fo(i,n) for(int i=0;i<(n);i++)
    #define me(a) memset(a,0,sizeof(a));
    #define one(x) cout<<(x)<<endl;
    #define two(a,b) cout<<(a)<<" "<<(b)<<endl;
    #define three(a,b,c) cout<<(a)<<" "<<(b)<<" "<<(c)<<endl;
    #define four(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl;
    //int dir[4][2]={-1,0,1,0,0,-1,0,1};
    //int dir[8][2]={-1,0,1,0,0,-1,0,1,-1,-1,1,1,1,-1,-1,1};
    //int dir[4][2]={-2,0,2,0,0,-2,0,2};
    int main()
    {
        //ios::sync_with_stdio(false);
        int n,i,l=0,r=0,ans=0,a,b;
    cin>>n;
    pair<int,int>p[1000];
    for(i=0;i<n;i++){
        cin>>p[i].first>>p[i].second;
    //p[i]=make_pair(a,b);
    if(p[i].first<0)
        l++;
    else
        r++;}
    
    sort(p,p+n);
    for(i=max(0,l-r-1);i<=min(n,l*2);i++)
    ans+=p[i].second;
    
    cout<<ans;
        return 0;
    }
  • 相关阅读:
    Codeforces_731_C
    Codeforces_731_B
    Codeforces_731_A
    HDU_1035_水
    POJ_3450_KMP
    POJ_2185_二维KMP
    POJ_2752_KMP
    Codeforces_492_E
    Codeforces_338_D
    Codeforces_327_C
  • 原文地址:https://www.cnblogs.com/wangmenghan/p/5943680.html
Copyright © 2011-2022 走看看