PAT (Advanced Level) Practice 1113 Integer Set Partition (25 分)
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1e5+5;
int a[N];
int main()
{
int n;scanf("%d",&n);
int sum=0,half=0;
for(int i=0;i<n;i++)
scanf("%d",a+i),sum+=a[i];
sort(a,a+n);
for(int i=1;i<=(n+1)/2;i++)
half+=a[ n-i];
printf("%d %d\n",n%2,2*half-sum);
return 0;
}
相關推薦
PAT (Advanced Level) Practice 1113 Integer Set Partition (25 分)
#include<cstdio> #include<algorithm> using namespace std; const int N=1e5+5; int a[N]; int main() { int n;scanf("%d",&n);
PAT (Advanced Level) Practice 1149 Dangerous Goods Packaging (25 分)set
1149 Dangerous Goods Packaging (25 分) When shipping goods with containers, we have to be careful not to pack some incompatible goods into
【笨方法學PAT】1113 Integer Set Partition (25 分)
一、題目 Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2
PAT (Advanced Level) Practice 1118 Birds in Forest (25 分) 並查集
Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are
PAT (Advanced Level) Practice 1094 The Largest Generation (25 分)樹的層次遍歷
A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find t
PAT (Advanced Level) Practice 1074 Reversing Linked List (25 分)
把連結串列按順序存下來之後,每k個反轉一次,輸出的時候,下一個節點的地址就是當前節點的next #include<cstdio> #include<algorithm> using namespace std; const int N=1e6+5; str
PAT (Advanced Level) Practice 1086 Tree Traversals Again (25 分)
用棧模擬即可 #include<cstdio> #include<vector> #include<stack> using namespace std; const int N=30+5; stack<int> stk; vect
PAT (Advanced Level) Practice 1012 The Best Rank (25 分) 排序
To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mat
PAT (Advanced Level) Practice 1150 Travelling Salesman Problem (25 分)
The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shor
PAT (Advanced Level) Practice 1118 Birds in Forest (25 分)
並查集 #include<cstdio> #include<algorithm> using namespace std; const int N=1e4+5; int f[N]; int Find(int x) { return f[x]==x
PAT (Advanced Level) Practice 1110 Complete Binary Tree (25 分)
#include<cstdio> #include<queue> using namespace std; const int N=20+5; int ch[N][2],vis[N]; int bfs(int s) { queue<int>
PAT (Advanced Level) Practice 1052 Linked List Sorting (25 分)
1052 Linked List Sorting (25 分) A linked list consists of a series of structures, which are not necessarily adjacent in memory. We
PAT (Advanced Level) Practice 1040 Longest Symmetric String (25 分) 最長迴文字串 dp
#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> using namespace std; const int maxn=
PAT (Advanced Level) Practice 1036 Boys vs Girls (25 分)
This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students. I
PAT (Advanced Level) Practice 1094 The Largest Generation (25 分)樹的層次遍歷
A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task
PAT (Advanced Level) Practice 1118 Birds in Forest (25 分) 並查集
Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same t
PAT (Advanced Level) Practice 1013 Battle Over Cities (25 分)
1013 Battle Over Cities (25 分) It is vitally important to have all the cities connected by highways in a war. If a city is occupied by th
PAT (Advanced Level) Practice 1036 Boys vs Girls (25 分)(C++)(甲級)
1036 Boys vs Girls (25 分) This time you are asked to tell the difference between the lowest grade of all the male students and the highest gra
1113 Integer Set Partition (25 分)
posit online input exactly auth mes class make each 1113 Integer Set Partition (25 分) Given a set of N (>1) positive integers,
PAT (Advanced Level) Practice 1054 The Dominant Color (20 分) map使用
Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color